Logic and Databases: A Deductive Approach

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	AoIBA, M., et el. 1982. Bases de donnes: Nouvelles perspectives. Rapport du groupe BD3 ADI-IN- RIA, Paris.
	2	Alfred V. Aho , Jeffrey D. Ullman, Universality of data retrieval languages, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.110-119, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567763]
	3	AHO, A. V., SAGIV, Y., AND ULLMAN, J. D. 1979. Equivalences among relational expressions. SIAM J. Comput. 8, 2 (May), 218-246.
	4	ANSI/X3/SPARC 1975. Study Group on DBMS Interim Report. SIGMOD FDT Bull 7, 2, 1975.
	5	ARMSTRONG, W. W. 1974. Dependency structures of database relationships. In Proceedings o{ IFIP 74. Elsevier North-Holland, New York, pp. 580-583.
	6	ARTIFICIAL INTELLIGENCE JOURNAL 1980. 13, 1, 2; Special issue on nonmonotonic logic.
	7	ARTRAUD, A., AND NICOLAS, J.-M. 1974. An experimental query system: SYNTEX. In Proceedings of the International Computin~ Symposium 73. Elsevier North-Holland, New York, pp. 557-563.
	8	BANCILHON, F. 1978. On the completeness of query languages for relational databases. In Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science. Springer-Verlag, Berlin and New York, pp. 112-123.
	9	BEERI, C., AND VARDI, M. Y. 1980. A proof procedure for data dependencies. Tech. Rep., Computer Science Dept., Hebrew Univ., Jerusalem (Aug.).
	10	Catriel Beeri , Moshe Y. Vardi, The Implication Problem for Data Dependencies, Proceedings of the 8th Colloquium on Automata, Languages and Programming, p.73-85, July 13-17, 1981
	11	BISKUP, J. A. 1981. A formal approach to null values in database relations. In Advances in Database Theory, vol. 1, H. Gallaire, J. Minker, and J~-M. Nicolas, Eds. Plenum, New York, pp. 299-341.
	12	B~sKuP, J. A. 1982. A foundation of Codd's relational maybe-operations. Tech. Rep., Computer Science Dept., Univ. of Dortmund, West Germany.
	13	BLAUSTEIN, B. T. 1981. Enforcing database assertions: Techniques and applications, Ph.D. dissertation, Computer Science Dept., Harvard Univ., Cambridge, Mass. (Aug.).
	14	BORGIDA, A., AND WONG, H. K. T. 1981. Data models and data manipulation languages: Complementary semantics and proof theory. In Proceedings of the 7th Con/erence on Very Large Data Bases (Cannes, France, Sept. 9-11). IEEE, New York, pp. 260-271.
	15	BOSSy, G., AND SIEGEL, P. 1981. La saturation au secours de la non-monotonicite. These de 3eme Cycle, D~partment d'Informatiques, Universit~ d'Aix- Marseille-Luminy, Marseille, France (June).
	16	BOWEN, K. A., AND KOWALSKI, R. A. 1982. Amalgamating language and metalanguage in logic programming. In Logic Programming, K. L. Clark and S. A. Tarnlund, Eds. Academic Press, New York, pp. 153-172.
	17	J. W. Thatcher, Data abstraction, data bases and conceptual modelling (Position Paper), Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling, p.196-197, June 23-26, 1980, Pingree Park, Colorado, United States
	18	Marco A. Casanova , Philip A. Bernstein, The logic of a relational data manipulation language, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.101-109, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567762]
	19	Marco R. Casanova , Phillip A. Bernstein, A Formal System for Reasoning about Programs Accessing a Relational Database, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.3, p.386-414, July 1980 [doi>10.1145/357103.357111]
	20	CHAKRAVARTHY, U. S., MINKER, J., AND TRAN, D. 1982. Interfacing predicate logic languages and relational databases. In Proceedings o{ the 1st Conference on Logic Programming (Marseille, France, Sept.). Universit~ d'Aix-Marseille-Luminy, Marseille, France, pp. 91-98.
	21	Donald D. Chamberlin , Morton M. Astrahan , Michael W. Blasgen , James N. Gray , W. Frank King , Bruce G. Lindsay , Raymond Lorie , James W. Mehl , Thomas G. Price , Franco Putzolu , Patricia Griffiths Selinger , Mario Schkolnick , Donald R. Slutz , Irving L. Traiger , Bradford W. Wade , Robert A. Yost, A history and evaluation of System R, Communications of the ACM, v.24 n.10, p.632-646, Oct. 1981 [doi>10.1145/358769.358784]
	22	Ashok K. Chandra , David Harel, Computable queries for relational data bases (Preliminary Report), Proceedings of the eleventh annual ACM symposium on Theory of computing, p.309-318, April 30-May 02, 1979, Atlanta, Georgia, United States [doi>10.1145/800135.804423]
	23	CHANDRA, A. K~, AND HAREL, D. 1980. Structure and complexity of relational queries. In Proceedings of the 21st IEEE Symposium on Foundations o{ Computer Science (Syracuse, N.Y., Oct.). {EEE, New York, pp. 333-347. Also in J. Comput. Syst. Sci. 25, 1 (Aug. 1982), 99-128.
	24	Ashok K. Chandra , Philip M. Merlin, Optimal implementation of conjunctive queries in relational data bases, Proceedings of the ninth annual ACM symposium on Theory of computing, p.77-90, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803397]
	25	Ashok K. Chandra , Harry R. Lewis , Johann A. Makowsky, Embedded implicational dependencies and their inference problem, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.342-354, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802488]
	26	C. L. Chang, The Unit Proof and the Input Proof in Theorem Proving, Journal of the ACM (JACM), v.17 n.4, p.698-707, Oct. 1970 [doi>10.1145/321607.321618]
	27	CHAN~, C. L. 1978. DEDUCE 2: Further investigations of deduction in relational databases. In Logic and Databases, H. Gallaire and J. Minker, Eels. Plenum, New York, pp. 201-236.
	28	CHANG, C. I J. 1981. On evaluation of queries containing derived relations in a relational database. In Advances in Database Theory, vol. 1, H. Gallairs, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 235-260.
	29	Chin-Liang Chang , Richard C. Lee , Richard Char-Tung Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, Inc., Orlando, FL, 1997
	30	CLARK, K. L. 1978. Negation as failure. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum, New York, pp. 293-322.
	31	E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM, v.13 n.6, p.377-387, June 1970 [doi>10.1145/362384.362685]
	32	CODD, E. F. 1972. Relational completeness of data* base sublanguages. In Data Base Systems, R. Rustin, Ed. Prentice-Hall, New York, pp. 65-98.
	33	E. F. Codd, Extending the database relational model to capture more meaning, ACM Transactions on Database Systems (TODS), v.4 n.4, p.397-434, Dec. 1979 [doi>10.1145/320107.320109]
	34	E. F. Codd, Data models in database management, Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling, p.112-114, June 23-26, 1980, Pingree Park, Colorado, United States
	35	E. F. Codd, Relational database: a practical foundation for productivity, Communications of the ACM, v.25 n.2, p.109-117, Feb 1982 [doi>10.1145/358396.358400]
	36	COLMERAUER, A. 1973. Un systeme de communication homme~machine en francais. Rapport, Groupe Intelligence Artificielle, Universit~ d'Aix- Marseille-Luminy, Marseilles, France.
	37	COLMERAUER, A., AND PIQUE, J. F. 1981. About natural logic. {n Advances in Database Theory vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 343-365.
	38	CoorEit, E. C. 1980. On the expressive power of query languages for relational databases. Tech. Rep. 14-80, Computer Science Dept., Harvard Univ., Cambridge, Mass.
	39	Veronica Dahl, On database systems development through logic, ACM Transactions on Database Systems (TODS), v.7 n.1, p.102-123, March 1982 [doi>10.1145/319682.319700]
	40	C. J. Date, An introduction to database systems: vol. I (4th ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	41	C. J. Date, An introduction to database systems: vol. I (4th ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	42	Amaryllis Deliyanni , Robert A. Kowalski, Logic and semantic networks, Communications of the ACM, v.22 n.3, p.184-192, March 1979 [doi>10.1145/359080.359090]
	43	Claude Delobel, Normalization and hierarchical dependencies in the relational data model, ACM Transactions on Database Systems (TODS), v.3 n.3, p.201-222, Sept. 1978 [doi>10.1145/320263.320271]
	44	DELOBr. L, C. 1980. An overview of the relational data theory. In Proceedings of IFIP 80. Elsevier North-Holland, New York, pp. 413-426.
	45	DELOBEL, C., AND CASE~, R. G. 1973. Decomposition of a database and the theory of Boolean switching functions. IBM J. Res. Dev. 17, 5 (Sept.), 484-485.
	46	DELOBEL, C., AND PARKER, D. S. 1978. Functional and multivalusd dependencies in a relational database and the theory of boolean switching functions. Tech. Rep. 142, Universit~ de Grenoble, Grenoble, France (Nov.).
	47	DEMOLOMBE, R. 1980. Estimation of the number of tuples satis~ying a query expressed in predicate calculus language. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct. 1-3). IEEE, New York, pp. 55- 63.
	48	DigMOLOMBE, R. 1981. Assigning meaning to ill-defined queries expressed in predicate calculus language. In Advances in Database Theory, vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 367-395.
	49	DI~MOLOMBE, R. 1982. Utilization du calcul des predicate comme langage d'interrogation des bases de donn6es. These de doctorat d'6tat, ONERA- CERT, Toulouse, France (Feb.).
	50	Robert A. Di Paola, The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas, Journal of the ACM (JACM), v.16 n.2, p.324-327, April 1969 [doi>10.1145/321510.321524]
	51	oos SAnTos, C, S., M^m^uM, T. S. E., ~~i) FURTAOO, A. L. 1981. Conceptual modeling of database operations. Int. J. Comput. Inf. Sci. 10, 5, 299- 314.
	52	ENDERTON, H. B. 1972. A Mathematical Introduction to Logic. Academic Press, New York.
	53	Ronald Fagin, Multivalued dependencies and a new normal form for relational databases, ACM Transactions on Database Systems (TODS), v.2 n.3, p.262-278, Sept. 1977 [doi>10.1145/320557.320571]
	54	FACtN, R. 1977b. Functional dependencies in a relational database and propositional logic. IBM J. Res. Dev. 21, 6 (Nov.), 534-544.
	55	Ronald Fagin, Horn clauses and database dependencies (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.123-134, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804660]
	56	Ronald Fagin, Horn clauses and database dependencies, Journal of the ACM (JACM), v.29 n.4, p.952-985, Oct. 1982 [doi>10.1145/322344.322347]
	57	Ronald Fagin , Jeffrey D. Ullman , Moshe Y. Vardi, On the semantics of updates in databases, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588100]
	58	FLORENTIN, J. J. 1974. Consistency auditing of data bases. Comput. J. 17, 1, 52-58.
	59	FURUg^WA, K. 1977. A deductive question-answering system on relational databases. In Proceedings o{ the 5th International Joint Conference on Artificial Intelligence (Cambridge, Mass., Aug.), pp. 59-66.
	60	Zvi Galil, An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database, Journal of the ACM (JACM), v.29 n.1, p.96-102, Jan. 1982 [doi>10.1145/322290.322296]
	61	GALLAIRE, H. 1981. Impacts of logic on data bases. In Proceedings of the 7~h International Conference on Very Large Data Bases (Cannes, France, Sept. 9-11). {EEE, New York, pp. 248--259.
	62	GALL^mE, H. 1983. Logic databases vs. deductive databases. Logic Programming Workshop (Albufeira, Portugal). University of Lisboa, Lisbon, Portugal, pp. 608-622.
	63	Herve Gallaire , Jack Minker, Logic and Data Bases, Perseus Publishing, 1978
	64	G~,LL~,IRE, H., MINKER, J., AND NICOL~,S, J.-M., Eds., 1981a. Advances in Data Base Theory, vol. 1. Plenum, New York.
	65	GALLAIRE, H., MINKER, J., AND NICOLAS, J.-M. 198lb. Background for ad,~ances in data base theory. In Advances in Data Base Theory, vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 3-21.
	66	Herve Gallaire , Jack Minker , Jean M. Nicholas, Advances in Data Base Theory, Perseus Publishing, 1981
	67	GARDARIN, G., AND MELKANOFF, M. 1979. Proving consistency of database transactions. In Proceedings of the 5th lnternationat Conference on Very Large Data Bases (Rio de Janeiro, Oct. 3-5). IEEE, New York, pp. 291-298.
	68	GR^NT, J. 1977. Null values in a relational data base. Inf. Process. Lett. 6, 5, 156-157.
	69	John Grant , Barry E. Jacobs, On the family of generalized dependency constraints, Journal of the ACM (JACM), v.29 n.4, p.986-997, Oct. 1982 [doi>10.1145/322344.322348]
	70	GRANT, J., AND MINKER, J. 1981. Optimization in deductive and conventional relational database systems. In Advances in Data Base Theory, vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 195-234.
	71	GRANT, J., AND MINgER, J. 1983. Answering queries in indefinite databases and the null value problem. Tech. Rep. 1374, Computer Science Dept., University of Maryland, College Park.
	72	GREEN, C. 1969. Theorem proving by resolution as a basis for question-answering systems. In Machine Intelligence 4, B. Meltzer and D. Michie, Eds. Elsevier North-Holland, New York, pp. 183- 205.
	73	HAMMER, M. T., AND ZDONIK, S. B., JR. 1980. Knowledge-based query processing. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct. 1-3'). IEEE, New York, pp. 137-147.
	74	David Harel, First-Order Dynamic Logic, Springer-Verlag New York, Inc., Secaucus, NJ, 1979
	75	HAREL, D. 1980. Review of Logic and Databases, H. Gallaire and J. Minker. Comput. Rev. 21, 8 (Aug.), 367-369.
	76	HENSCHEN, L. J., MCCUNE, W. W., AND NAQVI, S. A. 1984. C~mpiling constraint checking programs from first order formulas. In Advances in Database Theory, vol. 2, H. GaIlaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 145-169.
	77	HEWlTr, C. 1972. Description and theoretical analysis (using schemata) of PLANNER: A language for proving theorems and manipulating models in a robot. AI Memo No. 251, MIT Project MAC, Cambridge, Mass.
	78	HtLL, R. 1974. LUSH resolution and i~s completeness. DCS Memo, No. 78. University of Edinburgh, School of Artificial Intelligence.
	79	HOMEIER, P. V. 1981. Simplifying integrity constraints in a relational database: An implementation. M.Sc. thesis, Computer Science Dept., University of California, Los Angeles.
	80	}MIELINSKI, T., AND LIPSKt, W. 1981. On representing incomplete information in a relational database. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes, France, Sept. 9-11). IEEE, New York, pp. 389- 397.
	81	INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 1983. August, 8-12, 1983, KarLsruhe, West Germany.
	82	INTERNATIONAL SYMPOSIUM ON LOGIC PROGRAM- MING 1984. Feb. 6-9, 1984, Atlantic City, N.J.
	83	Barry E. Jacobs, On Database Logic, Journal of the ACM (JACM), v.29 n.2, p.310-332, April 1982 [doi>10.1145/322307.322310]
	84	Barry E. Jacobs , Anthony C. Klug , Alan R. Aronson, On interpretations of relational languages and solutions to the implied constraint problem, ACM Transactions on Database Systems (TODS), v.7 n.2, p.291-315, June 1982 [doi>10.1145/319702.319730]
	85	JAFFAR, J., LASSEZ, J. L., ANO LLOYO, J. 1983. Completeness of the negation by failure rule. In Proceedings of the 8th International Joint Conference on Artificial Intelligence (Karlsruhe, W. Germany, Aug.), pp. 500-506.
	86	JAr~AS, J. M. 1979. Towards more informative user interfaces. In Proceedings of the 5th International Conference on Very Large Data Bases (Rio de Janeiro, Oct. 3-5). IEEE, New York, pp. 17-23.
	87	JANAS, J. M. 1981. On the feasibility of informative answers. In Advances in Data Base Theory, vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 397-414.
	88	KELLOGG, C., AND TRAVIS, L. 1981. Reasoning with data in a deductively augmented data management system. In Advances in Data Base Theory, vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 261-295.
	89	KELLOGG, C., KLHAR, P., ANO TRAVIS, L. 1978. Deductive planning and path finding for relational data bases. In Logic and Database.% H. Ga!!aire and J. Minker, Eds. Plenum, New York, pp. 179-200.
	90	KING, J. J. 1981. QUIST: A system for semantic query optimization in relational databases. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes, France, Sept. 9-11). IEEE, New York, pp. 510-517.
	91	KONOLIGE, K. 1981. A metalanguage representation of databases for deductive question-answering syst~ems. In Proceedings of the 7th International Joint Conference on Artificial Intelligence (Vancouver, B.C., Aug.), pp. 469-503.
	92	KOW^LSK~, R. A. 1978. Logic for data description. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum, New York, pp. 77-103.
	93	Robert A. Kowalski, Logic for Problem Solving, Prentice Hall PTR, Upper Saddle River, NJ, 1979
	94	KOWALSKI, R. A. 1981a. Logic as a data base language. In Proceedings of the Advanced Seminar on Theoretical Issues in Data Bases (Cetraro, Italy, Sept.).
	95	KOWALSKI, R. A. 1981b. Personal communication.
	96	KOWALSKL R. A., AND KUE~NER, D. 1971. Linear resolution with selection function. Artif Inteli. 2, 3/4, 227-260.
	97	KUHNS, J. L. 1967. Answering questions by computers--A logical study. Rand Memo RM 5428 PR, Rand Corp., Santa Monica, Calif.
	98	KUHN8, J. L. 1970. Interrogating a relational data file: Remarks on the admissibility of input queries. Tech. Rep. TR-511-PR, Rand Corp., Santa Monica, Calif. (Nov.).
	99	KUNlrOJl, S., ANO YOKOTA, H. 1982. Prolog and relational databases for the fifth generation computer system. ICOT Rep. D02, Institute for New Generation Computer Technology, Tokyo.
	100	Michel Lacroix , Alain Pirotte, Associating types with domains of relational data bases, Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling, p.144-146, June 23-26, 1980, Pingree Park, Colorado, United States
	101	LEVESQUE, H. J. 1981. The interaction with incomplete knowledge bases: a formal treatment. Proceedings of the 7th International Joint Conference on Artificial Intelligence (Vancouver, B.C., Aug.), pp. 240-245.
	102	Witold Lipski, Jr., On semantic issues connected with incomplete information databases, ACM Transactions on Database Systems (TODS), v.4 n.3, p.262-296, Sept. 1979 [doi>10.1145/320083.320088]
	103	LoGIc PROGRAMMING WORKSHOP PROCEEDINGS 1983. June 26-July, 1, 1983, Praia da Falesia, Algarve, Portugal. Dept. of Computer Science, University of Lisboa, Lisbon, Portugal.
	104	LOVELAND, D. 1969. Theorem provers combining model elimination and resolution. In Machine Intelligence, vol. 4. B. Meltzer and D. Michie, Eds. Elsevier North-Holland, New York, pp. 73- 86.
	105	I,OWLANO, D. 1970. A linear format for resolution. Proceedings of the IRIA Symposium on Automatic Demonstration. Springer-Verlag, Berlin and New York, pp. 147-162.
	106	Donald W Loveland, Automated theorem proving: A logical basis (Fundamental studies in computer science), sole distributor for the U.S.A. and Canada, Elsevier North-Holland, 1978
	107	David Maier, Theory of Relational Databases, Computer Science Pr, 1983
	108	David Maier , Alberto O. Mendelzon , Yehoshua Sagiv, Testing implications of data dependencies, ACM Transactions on Database Systems (TODS), v.4 n.4, p.455-469, Dec. 1979 [doi>10.1145/320107.320115]
	109	MCCARTHY, J. 1980. Circumscription--A form of non-monotonic reasoning. Artif Intell. 13, 27-39.
	110	MCSKIMIN, J. 1976. Techniques for employing semantic information in question-answering systems. Ph.D. dissertation, Dept. of Computer Science, University of Maryland, College Park.
	111	MCSmMIN, J., ANO MINKRR, J. 1977. The use of a semantic network in a deductive question-answering system. In Proceedings of the 5th International Joint Conference on Artificial Intelligence (Cambridge, Mass., Aug.), pp. 50-58.
	112	Elliott Mendelson, Introduction to mathematical logic (3rd ed.), Wadsworth Publ. Co., Belmont, CA, 1987
	113	Jack Minker, Performing inferences over relation data bases, Proceedings of the 1975 ACM SIGMOD international conference on Management of data, May 14-16, 1975, San Jose, California [doi>10.1145/500080.500092]
	114	MINKER, J. 1975b. Set operations and inferences over relational databases. In Proceedings o/the 4th Texas Conference on Computing Systems (Nov.). Univ. of Texas, Austin, pp. 5A1. l-SAl.10.
	115	Jack Minker, Search strategy and selection function for an inferential relational system, ACM Transactions on Database Systems (TODS), v.3 n.1, p.1-31, March 1978 [doi>10.1145/320241.320242]
	116	MINKER, J. 1978b. An experimental relational data base system based on logic. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum, New York, pp. 107-147.
	117	Jack Minker, On Indefinite Databases and the Closed World Assumption, Proceedings of the 6th Conference on Automated Deduction, p.292-308, June 07-09, 1982
	118	MINKmt, J. 1983. On deductive relational databases. In Proceedings of the 5th International Conference on Collective Phenomena (July), J. L. Lebowitz, Ed., Annals of the New York Academy of Sciences, vol. 10. New York Academy of Science, New York, pp. 181-200.
	119	M{NKER, J., AND NICOLAS, J. M. 1982. On recursive axioms in deductive databases. Inf. Syst. 8, 1 (Jan.), 1-13.
	120	MINKER, J., AND PERLIS, D. 1983. On the semantics of circumscription. Tech. Rep., Computer Science Dept., Univ. of Maryland, College Park.
	121	Jack Minker , Donald Perlis, Applications of Protected Circumscription, Proceedings of the 7th International Conference on Automated Deduction, p.414-425, May 14-16, 1984
	122	MINKER, J., AND ZANON, G. 1982. An extension to linear resolution with selection function. Inf. Process. Lett. 14, 4 (June), 191-194.
	123	Robert C. Moore, Problems in logical form, Proceedings of the 19th annual meeting on Association for Computational Linguistics, June 29-July 01, 1981, Stanford, California [doi>10.3115/981923.981957]
	124	John Mylopoulos, An overview of Knowledge Representation, Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling, p.5-12, June 23-26, 1980, Pingree Park, Colorado, United States
	125	NAQVi, S. A., AND HENSCHEN, L. J. 1980. Performing inferences over recursive data bases. In Proceedings of the 1st Annual National Conference on Artificial Intelligence (Stanford, Conn., Aug.). AAAI, Palo Alto, Calif., pp. 263-265.
	126	Lawrence J. Henschen , Shamim A. Naqvi, On compiling queries in recursive first-order databases, Journal of the ACM (JACM), v.31 n.1, p.47-85, Jan. 1984 [doi>10.1145/2422.2423]
	127	J. M. Nicolas, First order logic formalization for functional, multivalued and mutual dependencies, Proceedings of the 1978 ACM SIGMOD international conference on management of data, May 31-June 02, 1978, Austin, Texas [doi>10.1145/509252.509269]
	128	NICOLAS, J.-M. 1979a. A property of logical formulas corresponding to integrity constraints on database relations. In Proceedings of the Workshop on Formal Bases for Data Bases (Toulouse, France). ONERA-CERT, Toulouse, France.
	129	NICOLAS, J.-M. 1979b. Logic for improving integrity checking in relational databases. Tech. Rep. ONERA-CERT, Toulouse, France (Feb.). Also in Acta In{. 18, 3 (Dec.), 227-253.
	130	NICOLAS, J.-M., AND GALLAIRE, H. 1978. Database: Theory vs. interpretation. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum, New York, pp. 33-54.
	131	NWOLAS, J.-M., AND SYRE, J. C. 1974. Natural question answering and automatic deduction in the system SYNTEX. In Proceedings of IFIP 1974. North-Holland, Amsterdam, pp. 595-599.
	132	NICOLAS, J.-M., AND YAZDANIAN, K. 1978. Integrity checking in deductive databases. In Log/c and Databases, H. Gallaire and J. Minker, Eds. Plenum, New York, pp. 325-346.
	133	NICOLAS, J.-M., AND YAZOANZAN, K. 1982. An outline of BDGEN: A deductive DBMS. Tech. Rep. TR-ONERA-CERT, Toulouse, France (Oct.). Also in Proceedings of IFIP 83 Congress. North- Holland, Amsterdam, 1983, pp. 711-717.
	134	PAREDAENS, J. 1978. On the expressive power of relational algebra. Inf. Process. Lett. 7, 2 (Feb.), 107-111.
	135	PARKER, D. S., AND DELOBEL, C. 1979. Algorithmic applications for a new result on multivalued dependencies. In Proceedings of the 5th Conference on Very Large Data Bases (Rio de Janeiro, Oct. 3-5). IEEE, New York, pp. 67-74.
	136	PIROTTE, A. 1976. Explicit description of entities and their manipulation in languages for the relational database model. Th~se de doctoral Universit6 libre de Bruxelles, Brussells, Belgium (Dec.).
	137	PIRoI'rE, A. 1978. High level data base query languages. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum, New York, pp. 409-436.
	138	PRATT, V. R. 1976. Semantical considerations on Floyd-Hoare logic, in Proceedings of the 17th IEEE Symposium Foundations of Computer Science (Oct.). IEEE, New York, pp. 409-120.
	139	PROCEEDINGS OF THE IST CONFERENCE ON LOGIC PROGRAMMING 1982. Marseille, France (Sept.), Universit~ d'Aix-Marseille-Luminy, Marseille.
	140	Raymond Reiter, Two Results on Ordering for Resolution with Merging and Linear Format, Journal of the ACM (JACM), v.18 n.4, p.630-646, Oct. 1971 [doi>10.1145/321662.321678]
	141	REITER, R. 1978a. On closed world databases, tn Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum, New York, pp. 56-76.
	142	R~.ITER, R. 1978b. Deductive question-answering on relational databases. In Logic and Data Bases, H. Gallaire and J. Minker, Eels. Plenum, New York, pp. 149-178.
	143	REITER, R. 1978c. On structuring a first-order database. In Proceedings of the 2nd Canadian Society {or Computer Science National Conference, Canada (July).
	144	Raymond Reiter, Equality and Domain Closure in First-Order Databases, Journal of the ACM (JACM), v.27 n.2, p.235-249, April 1980 [doi>10.1145/322186.322189]
	145	REtTER, R. 1981. On the integrity of first-order databases. In Advances in Data Base Theory, vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 137-158.
	146	REITtm, R. 1982. Circumscription implies predicate completion (sometimes). In Proceedings of the American Association for Artificial Intelligence 82 Conference (Pittsburgh, Pa., Aug.). AAAI, Menlo Park, Calif., pp. 418-420.
	147	Raymond Reiter, A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values, University of British Columbia, Vancouver, BC, Canada, 1983
	148	REITER, R. 1984. Towards a logical reconstruction of relational database theory. In On Conceptual Modeling, M. Brodie, J. Mylopoulos, and J. W. Schmidt, Eds. Springer-Verlag, Berlin and New York.
	149	J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
	150	ROUSSEL, P. 1975. PROLOG: Manuel de reference et d'utilisation. Tech. Rep., D~partement d'Informatiques, Universit~ d'Aix-Marseille-Luminy, Marseille, France (Sept.).
	151	Fereidoon Sadri , Jeffrey D. Ullman, A complete axiomatization for a large class of dependencies in relational datatbases, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.117-122, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804659]
	152	Fereidoon Sadri , Jeffrey D. Ullman, Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization, Journal of the ACM (JACM), v.29 n.2, p.363-372, April 1982 [doi>10.1145/322307.322312]
	153	Yehoshua Sagiv, An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic, Journal of the ACM (JACM), v.27 n.2, p.250-262, April 1980 [doi>10.1145/322186.322190]
	154	SAGIV, Y., AND FAGIN, R. 1979. An equivalence between relational database dependencies and a subset of propositional logic. Res. Rep. RJ2500, IBM Research Laboratories, San Jose, Calif. (Mar.).
	155	Yehoshua Sagiv , Claude Delobel , D. Scott Parker, Jr. , Ronald Fagin, An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic, Journal of the ACM (JACM), v.28 n.3, p.435-453, July 1981 [doi>10.1145/322261.322263]
	156	P. Griffiths Selinger , M. M. Astrahan , D. D. Chamberlin , R. A. Lorie , T. G. Price, Access path selection in a relational database management system, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582099]
	157	SHAPIRO, S. E., AND MCKAY, D. P. 1980. Inference with recursive rules. In Proceedings of the let Annual National Conference on Artificial Intelligence. AAAI, Palo Alto, Calif.
	158	SIKLOSSY, L., ANO LAUmEaE, J.-L. 1982. Removing restrictions in the relational database model: an application of problem solving techniques, in Proceedings of the American Association for Artificiat Intelligence 82 Conference (Pittsburgh, Pa., Aug.). AAAI, Menlo Park, Calif., pp. 310-313.
	159	Michael Stonebraker , Gerald Held , Eugene Wong , Peter Kreps, The design and implementation of INGRES, ACM Transactions on Database Systems (TODS), v.1 n.3, p.189-222, Sept. 1976 [doi>10.1145/320473.320476]
	160	Jeffrey D. Ullman, Principles of Database Systems, W. H. Freeman & Co., New York, NY, 1983
	161	ULLbIAN, J. D. 1982. Principles o{Databxse Systems, 2nd ed. Computer Science Press, Potomac, Md.
	162	Va~ EMOeN, M. H. 1978. Computation and deductive information retrieval. In Formal Description of Programming Concepts, E. J. Neuhold, Ed. Elsevier North-Holland, New York, pp. 421-440.
	163	M. H. Van Emden , R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM (JACM), v.23 n.4, p.733-742, Oct. 1976 [doi>10.1145/321978.321991]
	164	V ARD{, M. Y. 1981. The decision problem for database dependencies. Inf. Process. Lett. 12, 5 (Oct.), 251-254.
	165	Yannis Vassiliou, Null values in data base management a denotational semantics approach, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582123]
	166	VASSlUOU, Y. 1980. Functional dependencies and incomplete information. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct. 1-3). IEEE, New York, pp. 260-269.
	167	VELOSO, P. A. S., DE CASTILHO, J. M. V., ANI) FUR- Tar)o, A. L. 1981. Systematic derivation of complementary specifications. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes, France, Sept. 9-11). IEEE, New York, pp. 409-421.
	168	WARREN, D. H. D. 1981. Efficient processing of interactive relational database queries expressed in logic. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes, France, Sept. 9-11). 1EEE, New York, pp. 272- 28l.
	169	WOODS, W. A. 1967. Semantics for question-answering systems. Ph.D. dissertation, Rep. NSF- 19, Aiken Computation Laboratory, Harvard University, Cambridge, Mass.
	170	YANNAKAKIS, M.,AND PAPADIMITRIOU, C. 1982. Algebraic dependencies. J. Comput. Syst. Sci. 25, 1 (Aug.), 2-41.
	171	YOKOTA, H., KUNIFUJI, $., KAKUTA, T., MIYAZAKI, N., SHIBAYAMA, S., AND MURAKAMI, K. 1983. An enhanced inference mechanism for generating relational algebra queries. Tech. Rep. 026, ICOT Research Center, Institute for New Generation Computer Technology, Tokyo, Japan.
	172	ZANIOLO, C. 1976. Analysis and design of relational schemata for data base system. Tsch. Rap. UCLA Eng. 7769, Dept. of Computer Science, University of California, Los Angeles.
	173	ZANIOLO, C. 1981. Incomplete database information and null values: An overview. In Proceedings of the Advanced Seminar on Theoretical issues in Data Bases (Cetraro, Italy, Sept.).
	174	ZLOOP, M. M. 1977. Query-by-example: A data base language. IBM Syst. J. 16, 4, 324-343.