Logic and Databases: a 20 Year Retrospective

Jack Minker

• DVI
• PostScript

Abstract

At a workshop held in Toulouse, France in 1977, Gallaire, Minker and Nicolas stated that logic and databases was a field in its own right (see [131 ]). This was the first time that this designation was made. The impetus for this started approximately twenty years ago in 1976 when I visited Gallaire and Nicolas in Toulouse, France, which culminated in a workshop held in Toulouse, France in 1977. It is appropriate, then to provide an assessment as to what has been achieved in the twenty years since the field started as a distinct discipline. In this retrospective I shall review developments that have taken place in the field, assess the contributions that have been made, consider the status of implementations of deductive databases and discuss the future of work in this area.

Bibliography

1. HIPAC: a research project in active, time-constrained databases. Technical Report 187, Xerox Advanced Information Technologies, 1989.
2. S. Abiteboul and S. Grumback. A rule-based language with functions and sets. ACM Transactions on Database Systems, 16(1), 1991.
3. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley Publishing Comp, 1995.
4. J.J. Alferes and L.M. Pereira. On logic program semantics with two kinds of negation. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 574-588, Washington, D.C. USA, Nov 1992. The MIT Press.
5. P. Ammann, S. Jajodia, and I. Ray. Using formal methods to reason about semantics-based decompositions of transactions. In Proc. of 21st VLDB Conference, pages 218-227, 1995.
6. H. Andreka and I. Nemeti. The generalized completeness of horn predicate logic as a programming language. Acta Cybernetica, 4(1):3-10, 1978.
7. K.R. Apt and H.A. Blair. Arithmetic classification of perfect models of stratified programs. Fundamenta Informaticae, XIII:1-18, 1990. With addendum in vol. XIV: 339-343. 1991.
8. K.R. Apt, H.A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kaufmann Pub., Los Altos, California, 1988.
9. K.R. Apt and R.N. Bol. Logic programming and negation: a survey. Journal of Logic Programming, 19/20:9-71, May/June 1994.
10. R. Bagai and R. Sunderraman. Bottom-up computation of the fitting model for general deductive databases. Intelligent Information Systems, 6(1):59-75, Jan. 1996.
11. F. Bancilhon. Naive evaluation of recursively defined relations. In M. Brodie and J. Mylopoulos, editors, On Knowledge Base Management Systems--Integrating Database and AI Systems, pages 165-178. Springer-Verlag, 1986.
12. F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs. In Proc. ACM Symp. on Principles of Database Systems, March 1986.
13. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19/20:73-148, July 1994.
14. C. Baral, M. Gelfond, and A. Provetti. Representing Actions: Laws, Observations and Hypothesis. Journal of Logic Programming (to appear), 1996.
15. C. Baral, S. Kraus, and J. Minker. Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 3(2):208-220, July 1991.
16. C. Baral, S. Kraus, J. Minker, and V.S. Subrahmanian. Combining knowledge bases consisting of first order theories. Technical Report CS-2531, Dept of Computer Science, University of Maryland, College Park Md 20742, 1990.
17. C. Baral, S. Kraus, J. Minker, and V.S. Subrahmanian. Combining default logic databases. Journal of International Information Systems, 1994. To appear.
18. C. Baral, J. Lobo, and J. Minker. Generalized well-founded semantics for logic programs. In M. E. Stickel, editor, Proc. of Tenth Internatinal Conference on Automated Deduction, pages 102--116, Kaiserslautern, Germany, July 1989. Springer-Verlag.
19. C. Baral, J. Lobo, and J. Minker. Generalized disjunctive well-founded semantics for logic programs: Procedural semantics. In Proceedings of the Fifth International Symposium on Methodologies for Intelligent Systems, pages 456-464, Knoxville TN, USA, 1990.
20. C. Baral, J. Lobo, and J. Minker. Generalized disjunctive well-founded semantics for logic programs: Declarative semantics. In Proceedings of the Fifth International Symposium on Methodologies for Intelligent Systems, pages 465-473, Knoxville TN, USA, 1990.
21. C. Beeri, S. Naqvi, O. Shmueli, and S. Tsur. Set constructors in a logic database language. Journal of Logic Programming, 10 (3\&4), 1991.
22. C. Beeri and R. Ramakrishnan. On the power of magic. Journal of Logic Programming, 10(3/4):255-300, 1991.
23. C. Bell, A. Nerode, R. Ng, and V.S. Subrahmanian. Implementing stable model semantics by linear programming. In Proceedings of the 1993 International Workshop on Logic Programming and Non-monotonic Reasoning, June 1993.
24. J. Biskup. A formal approach to null values in database relations. In J. Minker H. Gallaire and J. M. Nicolas, editors, Advances in Data Base Theory, volume 1, pages 299-341. Plenum Press, New York, 1981.
25. J. Biskup. A foundation of Codd's relational maybe-operations. University Park, 1981. Pennsylvania State Univ.
26. H. Blair, W. Marek, and J. Schlipf. The expressiveness of locally stratified programs. Technical report, Mathematical Sciences Institute, Cornell University, 1992. Available as technical report 92-8.
27. B.T. Blaustein. Enforcing database assertions: techniques and applications. PhD thesis, Harvard University, Computer Science Dept., Cambridge, Mass., Aug. 1981. Ph.D. dissertation.
28. A. Bonner and M. Kifer. Transaction logic programming. In D. S. Warren, editor, Logic Programming: Proc. of the 10th International Conf., pages 257--279, 1993.
29. A. Borgida, R. J. Brachman, D. L. McGuiness, and L. A. Resnick. CLASSIC: A structural data model for objects. ACM SIGMOD Record, 18(2):58, June 1989. Also published in/as: 19 ACM SIGMOD Conf. on the Management of Data, (Portland OR), May--Jun 1989.
30. A. Borgida and D.W. Etherington. Hierarchical knowledge bases and efficient disjunction. In Proceedings of the First International Conference on Principle of Knowledge Representation and Reasoning (KR-89), pages 33-43, Toronto, Ontario, CANADA, 1989.
31. G. Bossu and P. Siegel. Saturation, nonmonotonic reasoning and the closed-world assumption. Artificial Intelligence, 25(1):13-63, January 1985.
32. R. J. Brachman and J. G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, pages 171-216, August 1985.
33. Ronald Brachman, Alexander Borgida, Deborah McGuinness, Peter Patel-Schneider, and Lori Resnick. The Classic knowledge representation system of KL-ONE: The next generation. In International Conference on Fifth Generation Computer Systems, pages 1036-1043, ICOT, Japan, 1992.
34. Ronald J. Brachman, Richard E. Fikes, and Hector J. Levesque. KRYPTON: A functional approach to knowledge representation. IEEE Computer, 16(10):67-73, October 1983.
35. Ronald J. Brachman, Victoria Pigman Gilbert, and Hector J. Levesque. An essential hybrid reasoning system: Knowledge and symbol level accounts of KRYPTON. In International Joint Conference on Artificial Intelligence, pages 532-539, August 1985.
36. F. Bry. Query evaluation in recursive databases: bottom-up and top-down reconciled. Data and Knowledge Engineering, 5:289-312, 1990.
37. F. Cacace, S. Ceri, S. Crespi-Reghizzi, and R. Zicari. Integrating object-oriented data modeling with a rule-based programming paradigm. In Proc. of ACM SIGMOD Conference on Management of Data, May 1990.
38. M. Cadoli. The complexity for model checking for circumscrioptive formulae. Information Processing Letters, 44:113-118, Oct 1992.
39. M. Cadoli and M. Lenzerini. The complexity of closed world reasoning and circumscription. J. Comp. and Syst. Sci., 43:165-211, 1994.
40. M. Cadoli and M. Schaerf. A survey of complexity results for non-monotonic logics. Journal of Logic Programming, 13:127-160, 1993.
41. S. Ceri, K. Tanaka, and S. Tsur, editors. Proc. of the 3rd Int. Conf. on Deductive and Obect-Oriented Databases - DOOD'93, December 1993. In LNCS 760, Springer-Verlag, Heidelberg, Germany.
42. U. S. Chakravarthy, John Grant, and Jack Minker. Foundations of semantic query optimization for deductive databases. In J. Minker, editor, Proc. Workshop on Foundations of Deductive Databases and Logic Programming, pages 67-101, Washington, D.C., August 1986.
43. U. S. Chakravarthy, John Grant, and Jack Minker. Logic based approach to semantic query optimization. ACM Transactions on Database Systems, 15(2):162-207, June 1990.
44. E. Chan. A possible world semantics for non-Horn databases, 1989. University of Waterloo, Canada.
45. E. Chan. A possible world semantics for disjunctive databases. IEEE Trans. Data and Knowledge Eng., 5(2):282-292, 1993.
46. A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer System Sciences, 25:99-128, 1982.
47. A. Chandra and D. Harel. Horn clause queries and generalizations. Journal of Logic Programming, 2(1):1-15, April 1985.
48. C.L. Chang. DEDUCE---a deductive query language for relational databases. In C.H. Chen, editor, Pattern Recognition and Artificial Intelligence, pages 108-134. Academic Press, New York, 1976.
49. C.L. Chang. Deduce 2: Further investigations of deduction in relational databases. In H. Gallaire J. Minker, editor, Logic and Databases, pages 201-236. Plenum, New York, 1978.
50. C.L. Chang. On evaluation of queries containing derived relations. In H. Gallaire J. Minker J-M. Nicolas, editor, Advances in Database Theory, Volume 1, pages 235-260. Plenum Press, New York, 1981.
51. S. Chawathe, H. Garcia-Molina, J. Hammer, K. Ireland, Y. Papakonstantinou, J. Ullman, and J. Widom. The TSIMMIS project: Integration of heterogeneous information sources. In Proceedings of IPSJ Conference, Tokyo, Japan, October 1994. Available via anonymous FTP from host db.stanford.edu, file /pub/chawathe/1994/tsimmis-overview.ps.
52. W. Chen and D.S. Warren. A goal-oriented approach to computing well founded semantics. In K.R. Apt, editor, Proceedings of the joint international conference and symposium on logic programming, Washington, D.C., Nov. 1992.
53. S. Chi and L. Henschen. Recursive query answering with non-Horn clauses. In E. Lusk and R. Overbeek, editors, Proc. 9^th International Conference on Automated Deduction, pages 294-312, Argonne, IL, May 1988.
54. D. Chimenti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur, and C. Zaniolo. The LDL system prototype. IEEE Transactions on Knowledge and Data Engineering, 2(1):76-90, 1990.
55. J. Chomicki. Efficient checking of temporal integrity constraints using bounded history encoding. ACM Transactions on Database Systems, 20(2):111-148, May 1995.
56. J. Chomicki and V.S. Subrahmanian. Generalized closed world assumption is \pi^0_2-complete. Information Processing Letters, 34:289-291, May 1990.
57. P. Chrysanthis and K. Ramamritham. Synthesis of extended transaction models using ACTA. ACM, TODS, 19(3):450-491, 1994.
58. Wesley W. Chu, Qiming Chen, and Andy Hwang. Query answering via cooperative data inference. Journal of Intelligent Information Systems, 3:57-87, 1994.
59. Wesley W. Chu, Qiming Chen, and Matthew A. Merzbacher. CoBase: A cooperative database system. Studies in Logic and Computation 3, chapter 2, pages 41-73. Clarendon Press, Oxford, 1994.
60. K. L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
61. CODASYL. CODASYL Data Base Task Group April 71 Report. ACM, New York, 1971.
62. E. F. Codd. Extending the database relational model to capture more meaning. ACM Transactions on Database Systems, 4(4):397-434, 1979.
63. E.F. Codd. A relational model of data for large shared data banks. Comm. ACM, 13(6):377-387, June 1970.
64. A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, Groupe de Intelligence Artificielle Universitae de Aix-Marseille II, Marseille, 1973.
65. Computer Corporation of America. Relational structures research. Technical report, August 5 1967. For Contract Period April 6, 1966-July 5, 1967.
66. Computer Corporation of America. Relational structures applications research. Technical report, July 11 1969. For Contract Period May 5, 1967-March 31, 1969.
67. M. Dalal. Some tractable classes of disjunctive logic programs. Technical report, Rutgers University, 1992.
68. C.J. Date. An Introduction to Database Systems, Sixth Edition. Addison-Wesley Publishing Comp, 1995.
69. H. Decker. Integrity enforcement on deductive databases. In Proc. 1st Int. Conf. on Expert Database Systems, April 1986.
70. Hendrik Decker. On alternative models, fixpoints and consistency of disjunctive databases, May 1991.
71. Hendrik Decker. On the declarative, operational and procedural semantics of disjunctive computational theories. In Proceedings of the 2^th International Workshop on the Deductive Approach to Information Systems and Databases, Aiguablava, Spain, September 1991. Invited paper.
72. C. Delobel, M. Kifer, and Y. Masunaga, editors. Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases - DOOD'91. Springer-Verlag, Heidelberg, Germany, December 1991.
73. S.W. Dietrich and D. S. Warren. Extension tables: memo relations in logic programming. In Proc. Symp. on Logic Programming, pages 264-273, San Francisco, Ca, 1987.
74. J. Dix. Classifying semantics of logic programs. In A. Nerode, W. Marek, and V.S. Subrahmanian, editors, Logic Programming and Non-monotonic Reasoning: Proceedings of the First International Workshop, pages 166-180. MIT Press, 1991.
75. J. Dix. Disjunctive deductive databases: theoretical foundations and operational semantics. PhD thesis, Institut fur informationssysteme abteilung wissensbasierte systeme, Technische Universitat Wien, Oct. 1995. Habilitation Thesis.
76. W.F. Dowling and J. H. Gallier. Linear time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 1:267-284, 1984.
77. J. Doyle. Truth Maintenance System. Artificial Intelligence, 13, 1980.
78. T. Eiter and G. Gottlob. Complexity aspects of various semantics for disjunctive databases. In Proceedings of the Twelfth ACM SIGART--SIGMOD--SIGART Symposium on Principles of Database Systems (PODS-93), pages 158-167. ACM Press, May 1993.
79. T. Eiter and G. Gottlob. Complexity results for disjunctive logic programming and application to nonmonotonic logics. In D. Miller, editor, Proceedings of the International Logic Programming Symposium ILPS'93, pages 266--278, Vancouver, Canada, October 1993. MIT Press.
80. T. Eiter and G. Gottlob. On the computation cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15(3-4):289-323, Dec. 1995.
81. T. Eiter, G. Gottlob, and H. Mannila. Adding Disjunction to Datalog. In Proceedings of the Thirteenth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '94), pages 267--278, May 1994.
82. R. Fagin, J.D. Ullman, and M.Y. Vardi. On the semantics of updates in databases. In Proc. Senth ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, pages 352-365, 1983.
83. A. Farrag and M. Ozsu. Using semantic knowledge of transactions to increase concurrency. ACM, TODS, 14(4):503-525, 1989.
84. J.A. Fernandez, J. Grant, and J. Minker. Model theoretic approach to view updates in deductive databases. Journal of Automated Reasoning. To appear.
85. J.A. Fernandez and J. Minker. Semantics of disjunctive deductive databases. In Proceedings of the International Conference on Database Theory, pages 332-356, 1992. (Invited Paper).
86. J.A. Fernandez and J. Minker. Theory and algorithms for disjunctive deductive databases. Programmirovanie, N 3:5-39, 1993. (also appears as University of Maryland Technical Report,CS-TR-3223, UMIACS-TR-94-17,1994. Invited Paper in Russian).
87. J.A. Fernandez and J. Minker. Bottom-up computation of perfect models for disjunctive theories. Journal of Logic Programming, 25(1):33-51, October, 1995.
88. Jose Alberto Fernandez and Jorge Lobo. A proof procedure for stable theories. Submitted to the Journal of Logic Programming, 1993.
89. Jose Alberto Fernandez, Jorge Lobo, Jack Minker, and V.S. Subrahmanian. Disjunctive LP + integrity constraints = stable models semantics. In Laks Lakshmanan, editor, Proceedings of the ILPS'91 Workshop on Deductive Databases, pages 110-117, San Diego, California, October 1991. Extended Version presented at the Second International Symposium on Artificial Intelligence.
90. Jose Alberto Fernandez, Jorge Lobo, Jack Minker, and V.S. Subrahmanian. Disjunctive LP + integrity constraints = stable model semantics. Annals of Mathematics and Artificial Intelligence, 8(3--4):449--474, 1993.
91. Jose Alberto Fernandez and Jack Minker. Bottom-up evaluation of Hierarchical Disjunctive Deductive Databases. In Koichi Furukawa, editor, Logic Programming Proceedings of the Eighth International Conference, pages 660--675. MIT Press, 1991.
92. Melvin Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2:295-312, 1985.
93. O. Friesen, G. Gauthier-Villars, A. Lefebvre, and L. Vieille. Applications of deductive object-oriented databases using del. In R. Ramakrishnan, editor, Applications of Logic Databases. Kluwer Academic Publishers, 1995.
94. O. Friesen, A. Lefebvre, and L. Vieille. VALIDITY: Applications of a dood system. In Proc. 5th Int. Conf. on Extending Database Technology - EDBT'96 (LNCS 1057), Avignon, France, March 1996. Springer Verlag.
95. T. Gaasterland, P. Godfrey, J. Minker, and L. Novik. A cooperative answering system. In Proceedings of the Logic Programming and Automated Reasoning Conference, St. Petersburg, Russia, July 1992.
96. T. Gaasterland and J. Lobo. Processing negation and disjunction in logic programs through integrity constraints. Journal of Intelligent Information Systems, 2(3), 1993.
97. Terry Gaasterland. Cooperative Answers for Database Queries. PhD thesis, University of Maryland, Department of Computer Science, College Park, 1992.
98. Terry Gaasterland, Parke Godfrey, and Jack Minker. An overview of cooperative answering. Journal of Intelligent Information Systems, 1(2):123-157, 1992. Invited paper.
99. Terry Gaasterland, Parke Godfrey, and Jack Minker. Relaxation as a platform for cooperative answering. Journal of Intelligent Information Systems, 1:293-321, 1992.
100. Terry Gaasterland, Parke Godfrey, Jack Minker, and Lev Novik. A cooperative answering system. In Andrei Voronkov, editor, Proceedings of the Logic Programming and Automated Reasoning Conference, Lecture Notes in Artificial Intelligence 624, pages 478-480. Springer-Verlag, St. Petersburg, Russia, July 1992.
101. Terry Gaasterland and Jack Minker. User needs and language generation issues in a cooperative answering system. In Patrick Saint-Dizier, editor, ICLP'91 Workshop: Advanced Logic Programming Tools and Formalisms for Language Processing, pages 1-14, INRIA, Paris, France, June 1991.
102. Terry Gaasterland, Jack Minker, and Arcot Rajasekar. Deductive database systems and knowledge base systems. In Proceedings of VIA 90, Barcelona, Spain, October 1990.
103. H. Gallaire and J. Minker, editors. Logic and Databases. Plenum Press, New York, April 1978.
104. H. Gallaire, J. Minker, and J-M. Nicolas, editors. Advances in Database Theory, volume 1. Plenum Press, 1981.
105. H. Gallaire, J. Minker, and J-M Nicolas, editors. Advances in Database Theory, volume 2. Plenum Press, 1984.
106. H. Gallaire, J. Minker, and J-M. Nicolas. Logic and databases: A deductive approach. ACM Computing Surveys, 16(2):153-185, June 1984.
107. H. Garcia-Molina. Using semantic knowledge for transaction processing in a distributed database. ACM, TODS, 8(2):186-213, 1983.
108. A. Van Gelder. The alternating fixpoint of logic programs with negation. In In Eighth ACM Symposium on Principles of Database Systems, 1989. Available from UC Santa Cruz as UCSC-CRL-88-17.
109. A. Van Gelder, K. Ross, and J.S. Schlipf. Unfounded Sets and Well-founded Semantics for General Logic Programs. In Proc. 7^th Symposium on Principles of Database Systems, pages 221-230, 1988.
110. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of The association for Computing Machinery, 38(3):620-650, July 1991.
111. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1070-1080, Seattle, WA. USA, Aug. 1988. The MIT Press.
112. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In D.H.D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 579-597, Jerusalem, Israel, June 1990. The MIT Press.
113. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
114. M. Gelfond and V. Lifschitz. Representing actions and change by logic programs. Journal of Logic Programming, 17(2,3,4):301-323, 1993.
115. M. Gelfond, H. Przymusinska, and T.C. Przymusinski. The extended closed world assumption and its relation to parallel circumscription. Proc. Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 133-139, 1986.
116. Parke Godfrey, Jarek Gryz, and Jack Minker. Semantic query evaluation for bottom-up evaluation. In Proc. ISMIS96, June 1996. University of Maryland Technical Report, CS-TR-3558, UMIACS-TR-95-109.
117. Parke Godfrey, Jack Minker, and Lev Novik. An architecture for a cooperative database system. In Witold Litwin and Tore Risch, editors, Proceedings of the First International Conference on Applications of Databases, Lecture Notes in Computer Science 819, pages 3-24. Springer Verlag, Vadstena, Sweden, June 1994.
118. G. Gottlob. Complexity and expressive power of disjunctive logic programming (research overview). In M. Bruynooghe, editor, International Logic Programming Symposium ILPS'94, pages 23--42, Ithaca, NY, USA, Nov 1994. The MIT Press.
119. J. Grant. Incomplete information in a relational database. In Proc. Fund Inf III, pages 363-378, 1980.
120. J. Grant, J. Horty, J. Lobo, and J. Minker. View updates in stratified disjunctive databases. Journal Automated Reasoning, 11:249-267, March 1993.
121. J. Grant and J. Minker. Answering queries in indefinite databases and the null value problem. In P. Kanellakis, editor, Advances in Computing Research: The Theory of Databases, pages 247-267. 1986.
122. John Grant, Jarek Gryz, and Jack Minker. Updating disjunctive databases via model trees. Technical Report CS-TR-3407, UMIACS-TR-95-11, Department of Computer Science, University of Maryland, College Park, MD 20742, February 1995.
123. C.C. Green and B. Raphael. Research in intelligent question answering systems. Proc. ACM 23rd National Conference, pages 169-181, 1968.
124. C.C. Green and B. Raphael. The use of theorem-proving techniques in question-answering systems. Proc. 23rd National Conference ACM, 1968.
125. H. Groiss. A formal semantics for a rule-based language. In IJCAI Workshop on Production Systems and their Innovative Applications, 1993.
126. M.T. Hammer and S.B. Zdonik. Knowledge-based query processing. Proc. 6th International Conference on Very Large Data Bases, pages 137-147, October 1980.
127. D. Harel. Review number 36,671 of Logic and Data Bases by H. Gallaire and J. Minker. Computing Reviews, 21(8):367-369, August 1980.
128. L.J. Henschen and S.A. Naqvi. On compiling queries in recursive first-order databases. J.ACM, 31(1):47-85, January 1984.
129. L.J. Henschen and H. Park. Compiling the GCWA in Indefinite Databases. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 395-438. Morgan Kaufmann Pub., Washington, D.C., 1988.
130. R. Hill. Lush resolution and its completeness. Technical Report DCL Memo 78, Department of Artificial Intelligence, University of Edinburgh, August 1974.
131. R. Hill. Lush resolution and its completeness. Technical Report DCL Memo 78, Department of Artificial Intelligence, University of Edinburgh, August 1974.
132. T. Imielinski. Incomplete deductive databases. Annals of Mathematics and Artificial Intelligence, 3:259-293, 1991.
133. T. Imielinski and W. Lipski. Incomplete information in relational databases. J. ACM, 31(4):761-791, 1984.
134. T. Imielinski and K. Vadaparty. Complexity of query processing in databases with OR-objects. In Proc. 7^th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, pages 51-65, Philadelphia, Pennsylvania, March 29-31 1989.
135. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction, pages 400-415, Saratoga Springs NY, USA, June 1992. Springer-Verlag.
136. K. Inoue and C. Sakama. A fixpoint characterization of abductive logic programs. Journal of Logic Programming, 27(2):107-136, May 1996.
137. A. Itai and J. A. Makowsky. On the complexity of Herbrand's theorem. Technical report, Dept. of Computer Science, Israael Institute of Technology, Haifa, 1982.
138. J. Jaffar and M. Maher. Constraint logic programming:a survey. Journal of Logic Programming, 19-20:503-581, May-July 1994.
139. J. Jafffar and J-L. Lassez. Constraint logic programming. In Proc. of the 14^th ACM Symposium on Principles of Programming Languages, pages 111-119, Munich, Germany, Jan 1987.
140. M. Jeusfeld and M. Staudt. Query optimization in deductive object bases. In G. Vossen, J. C. Feytag, and D. Maier, editors, Query Processing for Advanced Database Applications. Morgan-Kaufmann, 1993.
141. A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 6(2):719-770, 1993.
142. C. Kellogg, P. Klahr, and L. Travis. Deductive planning and pathfinding for relational data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 179-200. Plenum Press, New York, 1978.
143. W. Kiebling and H. Schmidt. DECLARE and SDS: Early efforts to commercialize deductive database technology. 1993.
144. M. Kifer, G. Lausen, and J. Wu. Logical Foundations of Object-Oriented and Frame-Based Languages. Journal of ACM-- to appear, 1993.
145. W. Kim, J-M. Nicolas, and S. Nishio, editors. Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases - DOOD'89. North-Holland Publishing Co., Amsterdam, The Netherlands, 1990, December 1990.
146. J.J. King. Quist: A system for semantic query optimization in relational databases. Proc. 7th International Conference on Very Large Data Bases, pages 510-517, September 1981.
147. P. Kolaitis and C. Papadimitriou. Why not negation by fixpoint? JCSS, 43, 1991.
148. H. Korth and G. Speegle. Formal aspects of concurrency control in long duration transaction systems using the NT/PV model. ACM, TODS, 19(3):492-535, 1994.
149. R. A. Kowalski. A proof procedure using connection graphs. Journal of the ACM, 22(4):572-595, Oct. 1975.
150. R. A. Kowalski and D. Kuehner. Linear Resolution with Selection Function. Artificial Intelligence, 2:227-260, 1971.
151. R.A. Kowalski. Predicate logic as a programming language. Proc. IFIP 4, pages 569-574, 1974.
152. R.A. Kowalski. Logic for data description. In H. Gallaire J. Minker, editor, Logic and Data Bases, pages 77-102. Plenum Press, New York, 1978.
153. Sarit Kraus, Daniel Lehmann, and Manachem Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artifitial Intelligence, (44):167-207, 1990.
154. J.L. Kuhns. Answering questions by computer: A logical study. Technical report, The Rand Corporation, December 1967.
155. J.L. Kuhns. Logical aspects of questions answering by computer. Third International Symposium on Computer and Information Sciences, December 1969.
156. J.L. Kuhns. Interrogating a relational data file: Remarks on the admissibility of input queries. Technical report, The Rand Corporation, November 1970.
157. A. Lefebvre and L. Vieille. On deductive query evaluation in the DedGin* system. In W. Kim, J-M. Nicolas, and S. Nishio, editors, 1st Int. Conf. on Deductive and Object-Oriented Databases, December 1989.
158. L. Lefebvre. Towards and efficient evaluation of recursive aggregates in deductive databases. In Proc. 4th Int. Conf. on Fifth Generation Computer Systems (FGCS), June 1992. extended version in. New Generation Computing 12, Ohmsha Ltd. \& Springer-Verlag, 1994.
159. N. Leone and P. Rullo. The safe computation of the well-founded semantics for logic programming. Information Systems, 17(1):17-31, Jan. 1992.
160. Y. Lesperance, H. Levesque, F. Lin, D. Marcu, R. Reiter, and R. Scherl. A logical approach to high level robot programming -- a progress report. In Working notes of the 1994 AAAI fall symposium on Control of the Physical World by Intelligent Systems, New Orleans, LA, November 1994.
161. H. Levesque, R. Reiter, Y. Lesperance, F. Lin, and R. Scherl. Golog: A logic programming language for dynamic domains. Journal of Logic Programming (to appear).
162. R. Levien. A computer system for inference execution and data retrieval. Comm. ACM, 10:715-721, 1967.
163. R. Levien and M.E. Maron. Relational Data File: A Tool for Mechanized Inference Execution and Data Retrieval. The Rand Corporation, December 1965.
164. R.E. Levien. Relational data file ii: Implementation. Proc. Third Annual National Colloquium on Information Retrieval, pages 225-241, May 1967.
165. R.E. Levien. Relational data file: Experience with a system for propositional data storage and inference execution. Technical report, The Rand Corporation, April 1969.
166. R.E. Levien and M.E. Maron. A computer system for inference execution and data retrieval. 10(11):715-721, Nov. 1967. Received September, 1966.
167. A.Y. Levy and Y. Sagiv. Semantic query optimization in datalog programs. In Principles of Database Systems 1996 (PODS96), 1996.
168. F. Lin and R. Reiter. How to progress a database II: The STRIPS connection. Technical report, Dept of Computer Science, University of Toronto, 1993.
169. F. Lin and R. Reiter. How to progress a database (and Why) I: Logical foundations. In KR94, pages 425-436, 1994.
170. T-W. Ling, A. Mendelzon, and L. Vieille, editors. Proc. 4th Int. Conf. on Deductive and Object-Oriented Databases - DOOD'95. Springer-Verlang, December 1995. LNCS 1013, Heidelberg, Germany.
171. W. Lipski. On databases with incomplete information. volume 28, pages 41-70. ACM, New York, 1981.
172. K.-C. Liu and R. Sunderraman. Indefinite and maybe information in relational databases. ACM Transactions on Database Systems, 15(1):1-39, 1990.
173. K.-C. Liu and R. Sunderraman. On representing indefinite and maybe information in relational databases: A generalization. In Proceedings of IEEE Data Engineering, pages 495--502, Los Angeles, February 1990.
174. Yuan Liu. Null values in definite programs. In S. Debray and M. Herme\-ne\-gildo, editors, Proceedings of North American Conference on Logic Programming, pages 273-288, Austin, Texas, October 1990. MIT Press.
175. J. W. Lloyd and R. W. Topor. A basis for deductive database systems. Journal of Logic Programming, 2(2):93-109, July 1985.
176. J.W. Lloyd. Foundations of Logic Programming. Springer--Verlag, second edition, 1987.
177. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.
178. J. Lobo, C. Yu, and G. Wang. Computing the transitive closure in disjunctive databases. Technical report, Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, 1992.
179. D. Loveland, D. Reed, and D. Wilson. Satchmore: Satchmo with relevancy. Technical report, April 1993.
180. D.W. Loveland. Near-Horn prolog. In J.L. Lassez, editor, Proc. 4^th International Conference on Logic Programming, pages 456-459, 1987.
181. C. Maindreville and E. Simon. Modeling non-deterministic queries and updates in deductive databases. In Proc. of VLDB, 1988.
182. V. W. Marek, A. Nerode, and J.B. Remmel. The stable models of a predicate logic program. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 446-460, Washington D.C., USA, Nov 1992. The MIT Press.
183. V. W. Marek and Truszczynski. Autoepistemic logic. Journal of the ACM, 38(3):588-619, 1991.
184. J. McCarthy. Circumscription - a form of non-monotonic reasoning. Artificial Intelligence Journal, 13:27-39, 1980.
185. McDermott and J. Doyle. Non-monotonic logic i. Artificial Intelligence Journal, 13:41-72, 1980.
186. J.R. McSkimin and J. Minker. The use of a semantic network in deductive question-answering systems. Proc. IJCAI 5, pages 50-58, 1977.
187. J. Melton. An SQL3 snapshot. In Twelfth International Conference on Data Engineering, pages 666-672, 1996.
188. J. Melton and A. R. Simon. Understanding the New SQL: A Complete Guide. Morgan Kaufmann, San Mateo, California, 1993.
189. R. Miller, Y. Ioannidis, and R. Ramakrishnan. Translation and integration of heterogeneous schemas: Bridging the gap between theory and practice. Information Systems, 19(1):3-31, Jan. 1994.
190. J. Minker. Search strategy and selection function for an inferential relational system. Transactions on Data Base Systems, 3(1):1-31, March 1978.
191. J. Minker. On indefinite databases and the closed world assumption. In Proceedings of the Sixth Conference on Automated Deduction, pages 292-308, 1982. Also in: \em Lecture Notes in Computer Science\/ 138, pages 292-308. Springer Verlag, 1982.
192. J. Minker, editor. Proceedings of Workshop on Foundations of Deductive Databases and Logic Programming, August 1986.
193. J. Minker, editor. Foundations of Deductive Databases and Logic Programming. Morgan-Kaufmann, 1988.
194. J. Minker. Perspectives in deductive databases. Journal of Logic Programming, 5:33-60, 1988.
195. J. Minker. Toward a foundation of disjunctive logic programming. In Proceedings of the North American Conference on Logic Programming, pages 121-125. MIT Press, 1989. Invited Banquet Address.
196. J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17(2, 3 and 4):95-126, November 1993.
197. J. Minker and J. Grant. Answering queries in indefinite databases and the null value problem. In P. Kanellakis, editor, Advances in Computing Research, pages 247-267. JAI Press, 1986.
198. J. Minker and J-M. Nicolas. On recursive axioms in deductive databases. Information Systems, 7(4):1-15, 1982.
199. J. Minker and A. Rajasekar. A Fixpoint Semantics for Non-Horn Logic Programs. Technical Report CS-TR-1869, Department of Computer Science University of Maryland, College Park, 1987.
200. J. Minker and A. Rajasekar. Procedural interpretation of non-Horn logic programs. In E.L. Lusk and R.A. Overbeek, editors, Proceedings of the Ninth International Conference on Automated Deduction, pages 278-293, Argonne, IL. USA, May 1988.
201. J. Minker and A. Rajasekar. Disjunctive logic programming. In Proceedings of the International Symposium on Methodologies for Intelligent Systems, pages 381-394, 1989. (Invited Lecture).
202. J. Minker and A. Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9(1):45-74, July 1990.
203. J. Minker and C. Ruiz. On extended disjunctive logic programs. In J. Komorowski and Z.W. Ras, editors, Proceedings of the Seventh International Symposium on Methodologies for Intelligent Systems, pages 1-18. Lecture Notes in AI. Springer-Verlag, June 1993. (Invited Paper).
204. J. Minker and C. Ruiz. Mixing a default rule with stable negation. In Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics, pages 122-125, Jan. 1996.
205. J. Minker and J.D. Sable. Relational data system study. Technical Report RADC-TR-70-180, Rome Air Development Center, Air Force Systems Command, Griffiss Air Force Base, New York, September 1970. Auerbach Corporation Report AD 720-263.
206. J. Minker and G. Zanon. An Extension to Linear Resolution with Selection Function. Information Processing Letters, 14(3):191-194, June 1982.
207. Jack Minker and Carolina Ruiz. Semantics for disjunctive logic programs with explicit and default negation. Fundamenta Informaticae, 20(3/4):145-192, 1994. Anniversary Issue edited by H. Rasiowa.
208. R.C. Moore. Possible-world semantics for autoepistemic logic. In Proceedings of AAAI Workshop on Non-Monotonic Reasoning, pages 396-401, New Paltz, 1984.
209. R.C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence 25, pages 75-94, 1985.
210. S. Morishita, M. Derr, and G. Phipps. Design and implementation of the Glue-Nail database system. In Proc. ACM-SIGMOD'93 Conf., pages 147-167, May 1993.
211. S. Muggleton and L. De Raedt. Inductive logic programming: theory and methods. Journal of Logic Programming, 19/20:629-679, May/July 1994.
212. I.S. Mumick, S. Finkelstein, H. Pirahesh, and R. Ramakrishnan. Magic is relevant. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, May 1990.
213. J.F. Naughton and Y. Sagiv. A decidable class of bounded recursions. Proc. of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 227-236, March 1987.
214. J.-M. Nicolas. Logic for improving integrity checking in relational databases. Acta Informatica, 18(3):227-253, Dec. 1979.
215. J-M. Nicolas and H. Gallaire. Data base: Theory vs. interpretation. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 33-54. Plenum Press, New York, 1978.
216. J-M. Nicolas and J-C. Syre. Natural question - answering and automatic deduction in system syntex. Proc. IFIP Congress 1974, pages 595-599, 1974.
217. J-M. Nicolas and K. Yazdanian. Integrity checking in deductive databases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 325-599. Plenum, New York, 1978.
218. P. Pearce and G. Wagner. Logic programming with strong negation. In P. Schroeder-Heister, editor, Proceedings of the International Workshop on Extensions of Logic Programming, pages 311-326, Tubingen, FRG, Dec. 1989. Lecture Notes in Artificial Intelligence, Springer -Verlag.
219. G. Phipps, M. Derr, and K.A. Ross. Glue-Nail: A deductive database system. In Proc. ACM-SIGMOD'91 Conf., May 1991.
220. Gregory Piatetsky-Shapiro and Wlliam J. Frawley, editors. Knowledge Discovery in Databases. AAAI Press and MIT Press, Menlo Park, California, 1991.
221. P. Powell. Answer-Reason extraction in a parallel relatioanal data base system. Master's thesis, Department of Computer Science, University of Maryland, College Park, MD 20742, 1977.
222. S. Pradhan. Combining datalog databases using priorities. In Advances in Data Management '94, pages 355-375. Tata-McGraw Hill, India, 1995.
223. S. Pradhan and J. Minker. Combining datalog databases using priorities. Journal of Intelligent \& Cooperative Information Systems, 1995.
224. S. Pradhan, J. Minker, and V.S. Subrahmanian. Combining databases with prioritized information. Journal of Intelligent Information Systems, 4(3):231-260, May 1995.
225. T. Przymusinski. Stationary semantics for disjunctive logic programs and deductive databases. In S. Debray and M. Hermenegildo, editors, Proc. of the North American Conference on Logic Programming, pages 40--62, Austin, Texas, October 1990.
226. T. C. Przymusinski. On the declarative semantics of deductive databases and logic programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 5, pages 193-216. Morgan Kaufmann Pub., Washington, D.C., 1988.
227. T. C. Przymusinski. On the Declarative and Procedural Semantics of Logic Programs. Journal of Automated Reasoning, 5:167-205, 1989.
228. T. C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In D.H.D. Warren and P. Szeredi, editors, Proceedings of the 7^th International Logic Programming Conference, pages 459-477, Jerusalem, 1990. MIT Press. Extended Abstract.
229. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401-424, 1991.
230. T.C. Przymusinski. Perfect model semantics. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1081-1096, Seattle, WA. USA, Aug. 1988. The MIT Press.
231. T.C. Przymusinski. Every logic program has a natural stratification and an iterated fixed point model. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems, pages 11-21, Philadelphia, PA. USA, 1989.
232. A. Rajasekar, J. Lobo, and J. Minker. Skeptical reasoning and disjunctive programs. In Proceedings of First International Conference on Knowledge Representation and Reasoning, pages 349-357. Morgan-Kaufmann, 1989.
233. A. Rajasekar, J. Lobo, and J. Minker. Weak generalized closed world assumption. Journal of Automated Reasonig, pages 293-307, 1989.
234. R. Ramakrishnan. Applications of Logic Databases. Kluwer Academic Publishers, 1995.
235. R. Ramakrishnan and J.D. Ullman. A survey of research on deductive database systems. Journal of Logic Programming, 23(2):125-149, May 1995.
236. Raghu Ramakrishnan, Divesh Srivastava, and S. Sudarshan. CORAL---control, relations and logic. In Li-Yan Yuan, editor, Proceedings of the 18\em th International Conference on Very Large Databases, pages 238--250, Vancouver, Canada, August 1992.
237. K. Ramamohanarao. An implementation overview of the Aditi deductive database system. In Lecture Notes in Computer Science 760, Third International Conference, DOOD'93, pages 184-203, Phoenix, AZ, December 1993. Springer-Verlag.
238. B. Raphael. A computer program for semantic information retrieval. In M. Minsky, editor, Semantic Information Processing, pages 33-134. MIT Press, 1968.
239. L. Raschid. A semantics for a class of stratified production system programs. Journal of Logic Programming, 21(1):31-57, 1994.
240. L. Raschid and J. Lobo. A semantics for a class of non-deterministic and causal production system programs. Journal of Automated Reasoning, 12:305-349, 1994.
241. L. Raschid and J. Lobo. Semantics for update rule programs and implementation in a relational database management system. ACM Transactions on Database Systems, 1996. To appear.
242. David W. Reed and Donald W. Loveland. A comparison of three prolog extensions. Technical Report CS-1989-8, Department of Conputer Science, Duke University, Durham, North Carolina 27706, March 1990. To appear in Journal of Logic Programming.
243. D.W. Reed, D.W. Loveland, and B.T. Smith. An alternative characterization of disjunctive logic programs. In Proceedings of the International Logic Programming Symposium, Cambridge, Massachusetts, 1991. MIT Press. Also: Technical Report, CS-1991-11. Dept. of Computer Science. Duke University.
244. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55-76. Plenum, New York, 1978.
245. R. Reiter. A logic for default reasoning. Artificial Intelligence Journal, 13:81-132, 1980.
246. R. Reiter. Towards A Logical Reconstruction of Relational Database Theory. In M.L. Brodie, J.L. Mylopoulos, and J.W. Schmit, editors, On Conceptual Modelling, pages 163-189. Springer--Verlag Pub., New York, 1984.
247. R. Reiter. A sound and sometimes complete query evaluation algorithm for relational databases with null values. J.ACM, 33(2):349-370, April 1986.
248. Raymond Reiter. On integrity constraints. In M. Y. Vardi, editor, Proceedings of the Second Conference on the Theoretical Aspects of Reasoning about Knowledge, pages 97-111, San Francisco, California, March 1988. Morgan Kaufmann Publishers, Inc.
249. Raymond Reiter. On asking what a database knows. In J.W. Lloyd, editor, Computational Logic, Basic research Series. Springer-Verlag Publishers, 1990. DG XIII Commission of the European Communities.
250. J.A. Robinson. A machine-oriented logic based on the resolution principle. J.ACM, 12(1), January 1965.
251. J. Rohmer, R. Lescoeur, and J-M. Kerisit. The Alexander method: a technique for the processing of recusive axioms in deductive databases. New Generation Computing, 4(3), 1986.
252. K. Ross. Well-founded semantics for disjunctive logic programs. In Proc. of the first International Conference on Deductive and Object Oriented Databases, pages 352--369, Kyoto, Japan, December 1989.
253. K.A. Ross. A procedural semantics for well-founded negation in logic programs. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems, Philadelphia, PA. USA, 1989.
254. K.A. Ross. Modular stratification and magic sets for datalog programs with negation. In Proc. ACM Symp. on Principles of Database Systems, April 1990.
255. K.A. Ross and R.W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4(2):397-424, December 1988.
256. D. Sacca and C. Zaniolo. On the implementation of a simple class of logic queries. In Proc. ACM Symp. on Principles of Database Systems, March 1986.
257. D. Sacca and C. Zaniolo. The generalized counting method for recursive logic queries. Theoretical Computer Science, 62, 1988.
258. Fariba Sadri and Robert Kowalski. Database integrity. chapter 9, pages 313-362. Morgan Kaufmann Publishers, 1988.
259. C. Sakama. Possible model semantics for disjunctive databases. In Proc. First International Conference on Deductive and Object Oriented Databases, pages 337-351, 1989.
260. E. Sandewall. Features and fluents: A systemetic approach to the representation of knowledge about dynamical systems. Technical report, Institutionen for datavetenskap, Universitetet och Tekniska hogskolan i Linkoping, Sweeden, 1992.
261. E. Sandewall. The range of applicability of some non-monotonic logics for strict inertia. Journal of Logic and Computation, 4(5):581-616, Oct. 1994.
262. D.A. Savitt, H.H. Love, and R.E. Troop. ASP: A new concept in language and machine organization. In 1967 Spring Joint Computer Conference, pages 87-102, 1967.
263. J.S. Schlipf. The expressive powers of the logic programming semantics. JCSS, 1990. A preliminary version appeared in Ninth ACM Symposium on Principles on Database Systems, pages 196-204, 1990.
264. J.S. Schlipf. Complexity and undecideability results for logic programming. Annals of Mathematics and Artificial Intelligence, 15(3-4):257-288, Dec 1995.
265. B. Selman and H.J. Levesque. Abductive and default reasoning: A computational core. In Proceedings AAAI-90, pages 343-348, Boston, MA, 1989.
266. S.E. Shapiro and D.P. McKay. Inferences with recursion. In Proceedings of the 1st Annual National Conference on Artificial Intelligence, 1980.
267. J.C. Shepherdson. Negation in Logic Programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 19-88. Morgan Kaufman Pub., 1988.
268. S. Sickel. A search technique for clause interconnectivity graphs. IEEE Transactions on Computers, C-25(8):823-835, Aug. 1976.
269. P. Sistla and O. Wolfson. Temporal conditions and integrity constraint checking in active database systems. In Proceedings of the 1995 ACM SIGMOD International Conferenece on Management of Data, San Jose, CA, 1995. ACM Press.
270. B.T. Smith and D. Loveland. A simple near-Horn Prolog interpreter. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5^th International Conference and Symposium on Logic Programming, pages 794-809, Seattle, Washington, August 1988.
271. R. M. Smullyan. Elementary formal system (abstract). Bull, AMS62, 1956.
272. R.M. Smullyan. On definability by recursion (abstract). Bull, AMS62, 1956.
273. R. Snodgrass. The temporal query language TQuel. ACM Transactions on Database Systems, 12(2):247--298, June 1987.
274. R. Snodgrass, editor. Data Engineering. IEEE Computer Society, December 1988. Special issue on temporal databases.
275. R. Snodgrass and E. McKenzie. Research concerning time in databases. SIGMOD Record, 15(4):19--52, December 1986.
276. M. Stickel. A PROLOG technology theorem prover: Implementation by an extended PROLOG compiler. Journal of Automated Reasoning, 4(4):353-380, 1988.
277. V.S. Subrahmanian, S. Adali, A. Brink, R. Emery, J. Lu, A. Rajput, T.J. Rogers, and R. Ross. Hermes: A heterogeneous reasoning and mediator system, 1994. Available from (http://www.cs.umd.edu/projects/hermes/overview/paper.
278. V.S. Subrahmanian and S. Jajodia. Multimedia Database Systems. Springer Verlag, 1995.
279. M. A. Suchenek. Minimal models for closed world databases. In Z.W. Ras, editor, Proc. of ISMIS 4, pages 515--522. Elsvier Sience Publishing Co. Inc., 1989.
280. The Validity Team. Summary state of the art on deductive and deductive object-oriented databases - dood. Technical report, Bull Corporation, April 1996. Groupe Bull report (limited distribution).
281. D.C. Tsichritzis and F.H. Lochovsky. Hierarchic data-base model: A survey. ACM Computing Surveys, 8(1):67-103, March 1976.
282. S. Tsur and C. Zaniolo. LDL: A logic-based data-language. In Proceedings of the 12th VLDB Conf, August 1986.
283. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Principles of Computer Science Series. Computer Science Press, Incorporated, Rockville, Maryland, 1988.
284. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, Volume II: The New Technologies. Principles of Computer Science Series. Computer Science Press, Incorporated, Rockville, Maryland, 1989.
285. J. Vaghani, K. Ramamohanarao, D. B. Kemp, and P. J. Stuckey. Design overview of the Aditi deductive database system. In Proc. of the 7th Intl. Conf. on Data Engineering, pages 240-247, April 1991.
286. M.H. van Emden and R.A. Kowalski. The Semantics of Predicate Logic as a Programming Language. J.ACM, 23(4):733-742, 1976.
287. A. Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 149-176. Morgan Kaufmann, 1988.
288. M.Y. Vardi. The complexity of relational query languages. In Proc. of the 14th ACM Symposium on Theory of Computing, pages 137-146, May 1982.
289. Y. Vassiliou. Null values in data base management: A denotational semantics approach. In Proceedings of the ACM SIGMOD International Symposium on Management of Data, pages 162-169, Boston, MA, 1979. ACM, New York.
290. L. Vieille. Recursive axioms in deductive databases: the Query/SubQuery approach. In Proc. 1st. Int. Conf. on Expert Database Systems, April 1986.
291. L. Vieille. Database-complete proof procedures based on SLD-resolutions. In Proc. 4th Int. Conf. on Logic Programming, May 1987.
292. L. Vieille. Recursive query processing: The power of logic. Theoretical Computer Science, 69, 1989.
293. L. Vieille, P. Bayer, V. Kuechenhoff, and A. Lefebvre. EKS-V1, a short overview. AAAI'90 Workshop on Knowledge Base Management Systems, July 1990.
294. L. Vielle, P. Bayer, and V. Kuechenhoff. Integrity checking and materialized view handling by update propagation in the EKS-V1 system. Technical report, 1991. to appear as a chapter in the book ``Materialized Views", A. Gupta and I. Mumick (eds), MIT Press, Cambridge, MA, USA, 1996.
295. A. Yahya and L.J. Henschen. Deduction in Non-Horn Databases. J. Automated Reasoning, 1(2):141-160, 1985.
296. L. Y. Yuan and D.-A. Chiang. A sound and complete query evaluation algorithm for relational databases with disjunctive information. In Proceedings of the Eighth Symposium on Principles of Database Systems, pages 66-74. ACM Press, March 1989.
297. C. Zaniolo. Database relations with null values. JCSS, 28:142-166, 1984.
298. C. Zaniolo. A unified semantics for active and deductive databases. In Proceedings of 1st international workshop on rules in database systems, pages 271-287. Springer-Verlag, 1993.
299. C. Zaniolo. Active database rules with transaction-conscious stable models semantics. In Proceedings of DOOD 1996, pages 55-72, 1996.