Advertisement

Logic and databases: A 20 year retrospective

  • Jack Minker
Invited Lecture
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1154)

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.

Keywords

Logic Program Logic Programming Integrity Constraint Nonmonotonic Reasoning Deductive Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul and S. Grumback. A rule-based language with functions and sets. ACM Transactions on Database Systems, 16(1):1–30, 1991.Google Scholar
  2. 2.
    S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley Publishing Comp, 1995.Google Scholar
  3. 3.
    J. Alferes and L. 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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    H. Andreka and I. Nemeti. The generalized completeness of horn predicate logic as a programming language. Acta Cybernetica, 4(1):3–10, 1978.Google Scholar
  6. 6.
    K. Apt and H. Blair. Arithmetic classification of perfect models of stratified programs. Fundamenta Informaticae, XIII:1–18, 1990. With addendum in vol. XIV: 339–343. 1991.Google Scholar
  7. 7.
    K. Apt, H. 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.Google Scholar
  8. 8.
    K. Apt and R. Bol. Logic programming and negation: a survey. Journal of Logic Programming, 19/20:9–71, May/June 1994.Google Scholar
  9. 9.
    P. Asirelli, C. Renso, and F. Turini. Language extensions for semantic integration of deductive databases. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 425–444, July 1–2 1996. Also in this collection.Google Scholar
  10. 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.Google Scholar
  11. 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.Google Scholar
  12. 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.Google Scholar
  13. 13.
    C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19/20:73–148, July 1994.Google Scholar
  14. 14.
    C. Baral, M. Gelfond, and A. Provetti. Representing Actions: Laws, Observations and Hypothesis. Journal of Logic Programming (to appear), 1996.Google Scholar
  15. 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.Google Scholar
  16. 16.
    C. Baral, S. Kraus, J. Minker, and V. 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.Google Scholar
  17. 17.
    C. Baral, S. Kraus, J. Minker, and V. Subrahmanian. Combining default logic databases. Journal of International Information Systems, 1994. To appear.Google Scholar
  18. 18.
    C. Baral and J. Lobo. Formal characterization of active databases. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 195–215, July 1–2 1996. Also in this collection.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    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.Google Scholar
  21. 21.
    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.Google Scholar
  22. 22.
    C. Baral and V. Subrahmanian. Stable and extension class theory for logic programs and default theory. Journal of Automated Reasoning, pages 345–366, 1992.Google Scholar
  23. 23.
    C. Beeri, S. Naqvi, O. Shmueli, and S. Tsur. Set constructors in a logic database language. Journal of Logic Programming, 10 (3&4), 1991.Google Scholar
  24. 24.
    C. Beeri and R. Ramakrishnan. On the power of magic. Journal of Logic Programming, 10(3/4):255–300, 1991.Google Scholar
  25. 25.
    C. Bell, A. Nerode, R. Ng, and V. Subrahmanian. Implementing stable model semantics by linear programming. In Proceedings of the 1993 International Workshop on Logic Programming and Non-monotonic Reasoning, June 1993.Google Scholar
  26. 26.
    R. Ben-Eliyahu and R. Dichter. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial intelligence, 12:53–87, 1994.Google Scholar
  27. 27.
    R. Ben-Eliyahu and L. Palopoli. Reasoning with minimal models: efficient algorithms and applications. In Proc. of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, pages 39–50, 1994. Full paper submitted for journal publication.Google Scholar
  28. 28.
    R. Ben-Eliyahu, L. Palopoli, and V. Zemlyanker. The expressive power of tractable disjunction. In W. Wahlster, editor, ECAI96. 12th European Conference on Artificial Intelligence, pages 345–349, 1996.Google Scholar
  29. 29.
    J. Biskup. A formal approach to null values in database relations. In H. Gallaire, J. Minker and J.M. Nicolas, editors, Advances in Data Base Theory, volume 1, pages 299–341. Plenum Press, New York, 1981.Google Scholar
  30. 30.
    J. Biskup. A foundation of Codd's relational maybe-operations. University Park, 1981. Pennsylvania State Univ.Google Scholar
  31. 31.
    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.Google Scholar
  32. 32.
    H. Blair and V. Subrahmanian. Paraconsistent logic.Google Scholar
  33. 33.
    B. Blaustein. Enforcing database assertions: techniques and applications. PhD thesis, Harvard University, Computer Science Dept., Cambridge, Mass., Aug. 1981. Ph.D. dissertation.Google Scholar
  34. 34.
    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.Google Scholar
  35. 35.
    A. Bonner and M. Kifer. Concurrency and communication in transaction logic. In D. Pedreschi and C Zaniolo, editors, Logic in Databases (LID'96), pages 153–172, July 1–2 1996. Also in this collection.Google Scholar
  36. 36.
    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.Google Scholar
  37. 37.
    A. Borgida and D. 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.Google Scholar
  38. 38.
    G. Bossu and P. Siegel. Saturation, nonmonotonic reasoning and the closed-world assumption. Artificial Intelligence, 25(1):13–63, Jan. 1985.Google Scholar
  39. 39.
    R. Brachman, A. Borgida, D. McGuinness, P. Patel-Schneider, and L. 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.Google Scholar
  40. 40.
    R. J. Brachman, R. E. Fikes, and H. J. Levesque. KRYPTON: A functional approach to knowledge representation. IEEE Computer, 16(10):67–73, Oct. 1983.Google Scholar
  41. 41.
    R. J. Brachman, V. P. Gilbert, and H. J. Levesque. An essential hybrid reasoning system: Knowledge and symbol level accounts of KRYPTON. In International Joint Conference on Artificial Intelligence, pages 532–539, Aug. 1985.Google Scholar
  42. 42.
    R. J. Brachman and J. G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, pages 171–216, Aug. 1985.Google Scholar
  43. 43.
    S. Brass. Sldmagic — an improved magic set technique. In B. Novikov and J. Schmidt, editors, Advances in Database and Information Systems — ADBIS'96, Sept 1996.Google Scholar
  44. 44.
    S. Brass and J. Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In L. Sterling, editor, Proceedings of the 12th Int. Conf. on Logic Programming, Tokyo, pages 199–213. MIT Press, June 1995.Google Scholar
  45. 45.
    S. Brass and J. Dix. A general approach to bottom-up computation of disjunctive semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, pages 127–155. Lecture Notes in Computer Science 927. Springer-Verlag, 1995.Google Scholar
  46. 46.
    S. Brass and J. Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, forthcoming, 1996.Google Scholar
  47. 47.
    S. Brass and J. Dix. Characterizing D-WFS: Confluence and Iterated GCWA. In L. Pereira and E. Orlowska, editors, JELIA '96, LNCS 1111, Berlin, 1996. Springer.Google Scholar
  48. 48.
    F. Bry. Query evaluation in recursive databases: bottom-up and top-down reconciled. Data and Knowledge Engineering, 5:289–312, 1990.Google Scholar
  49. 49.
    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.Google Scholar
  50. 50.
    M. Cadoli. The complexity for model checking for circumscrioptive formulae. Information Processing Letters, 44:113–118, Oct 1992.Google Scholar
  51. 51.
    M. Cadoli. Semantical and computational aspects of Horn approximations. In Proc. of IJCAI-93, pages 39–44, 1993.Google Scholar
  52. 52.
    M. Cadoli. Panel on “Knowledge compilation and approximation”: terminology, questions, references. In Proc. of the Fourth Int. Symp. on Artificial Intelligence and Mathematics, AI/Math-96, pages 183–186, January 3–5 1996.Google Scholar
  53. 53.
    M. Cadoli and M. Lenzerini. The complexity of closed world reasoning and circumscription. J. Comp. and Syst. Sci., 43:165–211, 1994.Google Scholar
  54. 54.
    M. Cadoli and M. Schaerf. A survey of complexity results for non-monotonic logics. Journal of Logic Programming, 13:127–160, 1993.Google Scholar
  55. 55.
    S. Ceri, K. Tanaka, and S. Tsur, editors. Proc. of the 3rd Int. Conf. on Deductive and Object-Oriented Databases — DOOD'93, December 1993. In LNCS 760, Springer-Verlag, Heidelberg, Germany.Google Scholar
  56. 56.
    U. Chakravarthy, J. Grant, and J. Minker. Logic-based approach to semantic query optimization. ACM Transactions on Database Systems, 15(2):162–207, June 1990.Google Scholar
  57. 57.
    U. S. Chakravarthy, J. Grant, and J. 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., Aug. 1986.Google Scholar
  58. 58.
    U. S. Chakravarthy, J. Grant, and J. Minker. Logic based approach to semantic query optimization. ACM Transactions on Database Systems, 15(2):162–207, June 1990.Google Scholar
  59. 59.
    E. Chan. A possible world semantics for non-Horn databases, 1989. University of Waterloo, Canada.Google Scholar
  60. 60.
    E. Chan. A possible world semantics for disjunctive databases. IEEE Trans. Data and Knowledge Eng., 5(2):282–292, 1993.Google Scholar
  61. 61.
    A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer System Sciences, 25:99–128, 1982.Google Scholar
  62. 62.
    A. Chandra and D. Harel. Horn clause queries and generalizations. Journal of Logic Programming, 2(1):1–15, Apr. 1985.Google Scholar
  63. 63.
    C. Chang. DEDUCE-a deductive query language for relational databases. In C. Chen, editor, Pattern Recognition and Artificial Intelligence, pages 108–134. Academic Press, New York, 1976.Google Scholar
  64. 64.
    C. Chang. Deduce 2: Further investigations of deduction in relational databases. In H. G. J. Minker, editor, Logic and Databases, pages 201–236. Plenum, New York, 1978.Google Scholar
  65. 65.
    C. Chang. On evaluation of queries containing derived relations. In H. G. J. M. J.-M. Nicolas, editor, Advances in Database Theory, Volume 1, pages 235–260. Plenum Press, New York, 1981.Google Scholar
  66. 66.
    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.Google Scholar
  67. 67.
    W. Chen and D. Warren. A goal-oriented approach to computing well founded semantics. In K. Apt, editor, Proceedings of the joint international conference and symposium on logic programming, Washington, D.C., Nov. 1992.Google Scholar
  68. 68.
    S. Chi and L. Henschen. Recursive query answering with non-Horn clauses. In E. Lusk and R. Overbeek, editors, Proc. 9th International Conference on Automated Deduction, pages 294–312, Argonne, IL, May 1988.Google Scholar
  69. 69.
    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.Google Scholar
  70. 70.
    J. Chomicki. Efficient checking of temporal integrity constraints using bounded history encoding. ACM Transactions on Database Systems, 20(2):111–148, May 1995.Google Scholar
  71. 71.
    J. Chomicki and V. Subrahmanian. Generalized closed world assumption is π20-complete. Information Processing Letters, 34:289–291, May 1990.Google Scholar
  72. 72.
    P. Chrysanthis and K. Ramamritham. Synthesis of extended transaction models using ACTA. ACM, TODS, 19(3):450–491, 1994.Google Scholar
  73. 73.
    W. W. Chu, Q. Chen, and A. Hwang. Query answering via cooperative data inference. Journal of Intelligent Information Systems, 3:57–87, 1994.Google Scholar
  74. 74.
    W. W. Chu, Q. Chen, and M. A. Merzbacher. CoBase: A cooperative database system. Studies in Logic and Computation 3, chapter 2, pages 41–73. Clarendon Press, Oxford, 1994.Google Scholar
  75. 75.
    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.Google Scholar
  76. 76.
    CODASYL. CODASYL Data Base Task Group April 71 Report. ACM, New York, 1971.Google Scholar
  77. 77.
    E. Codd. A relational model of data for large shared data banks. Comm. A CM, 13(6):377–387, June 1970.Google Scholar
  78. 78.
    E. F. Codd. Extending the database relational model to capture more meaning. ACM Trans. Database Syst., 4(4):397–434, 1979.Google Scholar
  79. 79.
    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.Google Scholar
  80. 80.
    Computer Corporation of America. Relational structures research. Technical report, Computer Corporation of America, August 5 1967. For Contract Period April 6, 1966–July 5, 1967.Google Scholar
  81. 81.
    Computer Corporation of America. Relational structures applications research. Technical report, Computer Corporation of America, July 11 1969. For Contract Period May 5, 1967–March 31, 1969.Google Scholar
  82. 82.
    M. Dalal. Some tractable classes of disjunctive logic programs. Technical report, Rutgers University, 1992.Google Scholar
  83. 83.
    S. Dar, H. Jagadish, A. Levy, and D. Srivastava. Answering queries with aggregation using views. In Proceedings of the 22nd International Conference on Very Large Databases, VLDB-96, Sept 1996. To appear.Google Scholar
  84. 84.
    C. Date. An Introduction to Database Systems, Sixth Edition. Addison-Wesley Publishing Comp, 1995.Google Scholar
  85. 85.
    H. Decker. Integrity enforcement on deductive databases. In Proc. 1st Int. Conf. on Expert Database Systems, April 1986.Google Scholar
  86. 86.
    H. Decker. On alternative models, fixpoints and consistency of disjunctive databases, May 1991.Google Scholar
  87. 87.
    H. Decker. On the declarative, operational and procedural semantics of disjunctive computational theories. In Proceedings of the 2th International Workshop on the Deductive Approach to Information Systems and Databases, Aiguablava, Spain, Sept. 1991. Invited paper.Google Scholar
  88. 88.
    A. del Val. Tractable databases: how to make propositional unit resolution complete through compilation. In Proc. of KR-94, pages 551–561, 1994.Google Scholar
  89. 89.
    A. del Val. An analysis of approximate knowledge compilation. In Proc. of IJCAI-95, 1995.Google Scholar
  90. 90.
    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.Google Scholar
  91. 91.
    R. Demolombe and A. J. Jones. Integrity constraints revisited. Journal of the IGPL (Interest Group in Pure and Applied Logics): An Electronic Journal on Pure and Applied Logic, 4(3):369–383, 1996.Google Scholar
  92. 92.
    S. 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.Google Scholar
  93. 93.
    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, Cambridge, Mass., July 1991. Washington D.C, MIT Press.Google Scholar
  94. 94.
    J. Dix. A Framework for Representing and Characterizing Semantics of Logic Programs. In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR '92), pages 591–602. San Mateo, CA, Morgan Kaufmann, 1992.Google Scholar
  95. 95.
    J. Dix. Classifying Semantics of Disjunctive Logic Programs. In K. R. Apt, editor, Logic Programming: Proceedings of the 1992 Joint International Conference and Symposium, pages 798–812, Cambridge, Mass., November 1992. MIT Press.Google Scholar
  96. 96.
    J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, XXII(3):227–255, 1995.Google Scholar
  97. 97.
    J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257–288, 1995.Google Scholar
  98. 98.
    J. Dix. Disjunctive deductive databases: theoretical foundations and operational semantics. PhD thesis, Institut für Informationssysteme abteilung wissensbasierte systeme, Technische Universität Wien, Sept 1995. Habilitation Thesis.Google Scholar
  99. 99.
    J. Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In A. Fuhrmann and H. Rott, editors, Logic, Action and Information — Essays on Logic in Philosophy and Artificial Intelligence, pages 241. DeGruyter, 1995.Google Scholar
  100. 100.
    G. Dobbie and R. Topor. Arithmetic and aggregate operators in deductive objectoriented databases. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 399–407, July 1–2 1996. Also in this collection.Google Scholar
  101. 101.
    W. Dowling and J. H. Gallier. Linear time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 1:267–284, 1984.Google Scholar
  102. 102.
    J. Doyle. Truth Maintenance System. Artificial Intelligence, 13, 1980.Google Scholar
  103. 103.
    P. Dung. Negations as hypothesis: an abductive foundation for logic programming. In Proc. of the 8th International Conference on Logic Programming, 1991.Google Scholar
  104. 104.
    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–67. ACM Press, May 1993.Google Scholar
  105. 105.
    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.Google Scholar
  106. 106.
    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.Google Scholar
  107. 107.
    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.Google Scholar
  108. 108.
    T. Eiter, N. Leone, and D. Saccà. The expressive power of partial models for disjunctive databases. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 261–280, July 1–2 1996. Also in this collection.Google Scholar
  109. 109.
    R. Fagin, J. Ullman, and M. Vardi. On the semantics of updates in databases. In Proc. Senth ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, pages 352–65, 1983.Google Scholar
  110. 110.
    A. Farrag and M. Ozsu. Using semantic knowledge of transactions to increase concurrency. ACM, TODS, 14(4):503–525, 1989.Google Scholar
  111. 111.
    J. Fernández, J. Grant, and J. Minker. Model theoretic approach to view updates in deductive databases. Journal of Automated Reasoning, 1996. To appear.Google Scholar
  112. 112.
    J. Fernández and J. Minker. Semantics of disjunctive deductive databases. In Proceedings of the International Conference on Database Theory, pages 332–356, 1992. (Invited Paper).Google Scholar
  113. 113.
    J. Fernández 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).Google Scholar
  114. 114.
    J. Fernández and J. Minker. Bottom-up computation of perfect models for disjunctive theories. Journal of Logic Programming, 25(1):33–51, October, 1995.Google Scholar
  115. 115.
    J. A. Fernández and J. Lobo. A proof procedure for stable theories. Submitted to the Journal of Logic Programming, 1993.Google Scholar
  116. 116.
    J. A. Fernández, J. Lobo, J. Minker, and V. Subrahmanian. Disjunctive LP + integrity constraints=stable models semantics. In L. Lakshmanan, editor, Proceedings of the ILPS'91 Workshop on Deductive Databases, pages 110–117, San Diego, California, Oct. 1991. Extended Version presented at the Second International Symposium on Artificial Intelligence.Google Scholar
  117. 117.
    J. A. Fernández, J. Lobo, J. Minker, and V. Subrahmanian. Disjunctive LP + integrity constraints=stable model semantics. Annals of Mathematics and Artificial Intelligence, 8(3–4):449–474, 1993.Google Scholar
  118. 118.
    J. A. Fernández and J. Minker. Bottom-up evaluation of Hierarchical Disjunctive Deductive Databases. In K. Furukawa, editor, Logic Programming Proceedings of the Eighth International Conference, pages 660–675. MIT Press, 1991.Google Scholar
  119. 119.
    M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2:295–312, 1985.Google Scholar
  120. 120.
    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.Google Scholar
  121. 121.
    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.Google Scholar
  122. 122.
    T. Gaasterland. Cooperative Answers for Database Queries. PhD thesis, University of Maryland, Department of Computer Science, College Park, 1992.Google Scholar
  123. 123.
    T. Gaasterland, P. Godfrey, and J. Minker. An overview of cooperative answering. Journal of Intelligent Information Systems, 1(2):123–157, 1992. Invited paper.Google Scholar
  124. 124.
    T. Gaasterland, P. Godfrey, and J. Minker. An overview of cooperative answering. Journal of Intelligent Information Systems, 1(2), 1992.Google Scholar
  125. 125.
    T. Gaasterland, P. Godfrey, and J. Minker. Relaxation as a platform for cooperative answering. Journal of Intelligent Information Systems, 1:293–321, 1992.Google Scholar
  126. 126.
    T. Gaasterland, P. Godfrey, J. Minker, and L. Novik. A cooperative answering system. In A. 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.Google Scholar
  127. 127.
    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.Google Scholar
  128. 128.
    T. Gaasterland and J. Lobo. Processing negation and disjunction in logic programs through integrity constraints. Journal of Intelligent Information Systems, 2(3), 1993.Google Scholar
  129. 129.
    T. Gaasterland and J. Minker. User needs and language generation issues in a cooperative answering system. In P. Saint-Dizier, editor, ICLP'91 Workshop: Advanced Logic Programming Tools and Formalisms for Language Processing, pages 1–14, INRIA, Paris, France, June 1991.Google Scholar
  130. 130.
    T. Gaasterland, J. Minker, and A. Rajasekar. Deductive database systems and knowledge base systems. In Proceedings of VIA 90, Barcelona, Spain, Oct. 1990.Google Scholar
  131. 131.
    H. Gallaire and J. Minker, editors. Logic and Databases. Plenum Press, New York, Apr. 1978.Google Scholar
  132. 132.
    H. Gallaire, J. Minker, and J.-M. Nicolas, editors. Advances in Database Theory, volume 1. Plenum Press, 1981.Google Scholar
  133. 133.
    H. Gallaire, J. Minker, and J.-M. Nicolas, editors. Advances in Database Theory, volume 2. Plenum Press, 1984.Google Scholar
  134. 134.
    H. Gallaire, J. Minker, and J.-M. Nicolas. Logic and databases: A deductive approach. ACM Computing Surveys, 16(2):153–185, June 1984.Google Scholar
  135. 135.
    H. Garcia-Molina. Using semantic knowledge for transaction processing in a distributed database. ACM, TODS, 8(2):186–213, 1983.Google Scholar
  136. 136.
    A. V. Gelder. The alternating fixpoint of logic programs with negation. In In Eighth ACM Symposium on Principles of Database Systems, pages 1–10, 1989. Available from UC Santa Cruz as UCSC-CRL-88-17.Google Scholar
  137. 137.
    A. V. Gelder, K. Ross, and J. Schlipf. Unfounded Sets and Well-founded Semantics for General Logic Programs. In Proc. 7th Symposium on Principles of Database Systems, pages 221–230, 1988.Google Scholar
  138. 138.
    A. V. Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. Journal of The association for Computing Machinery, 38(3):620–650, July 1991.Google Scholar
  139. 139.
    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.Google Scholar
  140. 140.
    M. Gelfond and V. Lifschitz. Logic programs with classical negation. In 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.Google Scholar
  141. 141.
    M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.Google Scholar
  142. 142.
    M. Gelfond and V. Lifschitz. Representing actions and change by logic programs. Journal of Logic Programming, 17(2, 3, 4):301–323, 1993.Google Scholar
  143. 143.
    M. Gelfond, H. Przymusinska, and T. 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.Google Scholar
  144. 144.
    P. Godfrey, J. Gryz, and J. 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.Google Scholar
  145. 145.
    P. Godfrey, J. Minker, and L. Novik. An architecture for a cooperative database system. In W. Litwin and T. 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.Google Scholar
  146. 146.
    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.Google Scholar
  147. 147.
    J. Grant. Incomplete information in a relational database. In Proc. Fund Inf III, pages 363–378, 1980.Google Scholar
  148. 148.
    J. Grant, J. Gryz, and J. 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, Feb. 1995.Google Scholar
  149. 149.
    J. Grant, J. Horty, J. Lobo, and J. Minker. View updates in stratified disjunctive databases. Journal Automated Reasoning, 11:249–267, March 1993.Google Scholar
  150. 150.
    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.Google Scholar
  151. 151.
    C. Green and B. Raphael. Research in intelligent question answering systems. Proc. ACM 23rd National Conference, pages 169–181, 1968.Google Scholar
  152. 152.
    C. Green and B. Raphael. The use of theorem-proving techniques in question-answering systems. Proc. 23rd National Conference ACM, 1968.Google Scholar
  153. 153.
    H. Groiss. A formal semantics for a rule-based language. In IJCAI Workshop on Production Systems and their Innovative Applications, 1993.Google Scholar
  154. 154.
    M. Hammer and S. Zdonik. Knowledge-based query processing. Proc. 6th International Conference on Very Large Data Bases, pages 137–147, Oct. 1980.Google Scholar
  155. 155.
    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.Google Scholar
  156. 156.
    L. Henschen and S. Naqvi. On compiling queries in recursive first-order databases. J.ACM, 31(1):47–85, Jan. 1984.Google Scholar
  157. 157.
    L. 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.Google Scholar
  158. 158.
    R. Hill. Lush resolution and its completeness. Technical Report DCL Memo 78, Department of Artificial Intelligence, University of Edinburgh, August 1974. 159. R. Hill. Lush resolution and its completeness. Technical Report DCL Memo 78, Department of Artificial Intelligence, University of Edinburgh, August 1974.Google Scholar
  159. 160.
    T. Imielinski. Incomplete deductive databases. Annals of Mathematics and Artificial Intelligence, 3:259–293, 1991.Google Scholar
  160. 161.
    T. Imielinski and W. Lipski. Incomplete information in relational databases. J. ACM, 31(4):761–791, 1984.Google Scholar
  161. 162.
    T. Imielinski and K. Vadaparty. Complexity of query processing in databases with OR-objects. In Proc. 7th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, pages 51–65, Philadelphia, Pennsylvania, March 29–31 1989.Google Scholar
  162. 163.
    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.Google Scholar
  163. 164.
    K. Inoue and C. Sakama. A fixpoint characterization of abductive logic programs. Journal of Logic Programming, 27(2):107–136, May 1996.Google Scholar
  164. 165.
    A. Itai and J. A. Makowsky. On the complexity of Herbrand's theorem. Technical report, Dept. of Computer Science, Israel Institute of Technology, Haifa, 1982.Google Scholar
  165. 166.
    J. Jaffar and M. Maher. Constraint logic programming:a survey. Journal of Logic Programming, 19–20:503–581, May–July 1994.Google Scholar
  166. 167.
    J. Jafffar and J.-L. Lassez. Constraint logic programming. In Proc. of the 14th ACM Symposium on Principles of Programming Languages, pages 111–119, Münich, Germany, Jan 1987.Google Scholar
  167. 168.
    H. Jakobovits and D. Vermier. R-stable models for logic programs. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 251–259, July 1–2 1996. Also in this collection.Google Scholar
  168. 169.
    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.Google Scholar
  169. 170.
    A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 6(2):719–770, 1993.Google Scholar
  170. 171.
    H. Kautz and B. Selman. Forming concepts for fast inference. In Proc. of AAAI-92, pages 786–793, 1992.Google Scholar
  171. 172.
    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.Google Scholar
  172. 173.
    B. Kero and S. Tsur. The \(\mathcal{I}\mathcal{Q}\) system: a deductive database information lens for reasoning about textual information. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 377–395, July 1–2 1996. Also in this collection.Google Scholar
  173. 174.
    W. Kiebling and H. Schmidt. DECLARE and SDS: Early efforts to commercialize deductive database technology. 1993.Google Scholar
  174. 175.
    M. Kifer, G. Lausen, and J. Wu. Logical Foundations of Object-Oriented and Frame-Based Languages. Journal of ACM-to appear, 1993.Google Scholar
  175. 176.
    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.Google Scholar
  176. 177.
    J. King. Quist: A system for semantic query optimization in relational databases. Proc. 7th International Conference on Very Large Data Bases, pages 510–517, Sept. 1981.Google Scholar
  177. 178.
    P. Kolaitis and C. Papadimitriou. Why not negation by fixpoint? JCSS, 43:125, 1991.Google Scholar
  178. 179.
    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.Google Scholar
  179. 180.
    R. Kowalski. Predicate logic as a programming language. Proc. IFIP, 4, pages 569–574, 1974.Google Scholar
  180. 181.
    R. Kowalski. Logic for data description. In H. G. J. Minker, editor, Logic and Data Bases, pages 77–102. Plenum Press, New York, 1978.Google Scholar
  181. 182.
    R. Kowalski and F. Sadri. Towards a unified agent architecture that combines rationality with reactivity. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 131–150, July 1–2 1996. Also in this collection.Google Scholar
  182. 183.
    R.A. Kowalski. A proof procedure using connection graphs. Journal of the ACM, 22(4):572–595, Oct. 1975.Google Scholar
  183. 184.
    R. A. Kowalski and D. Kuehner. Linear Resolution with Selection Function. Artificial Intelligence, 2:227–260, 1971.Google Scholar
  184. 185.
    S. Kraus, D. Lehmann, and M. Magidor. Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. Artificial Intelligence, 44(1):167–207, 1990.Google Scholar
  185. 186.
    J. Kuhns. Answering questions by computer: A logical study. Technical report, The Rand Corporation, Dec. 1967.Google Scholar
  186. 187.
    J. Kuhns. Logical aspects of questions answering by computer. Third International Symposium on Computer and Information Sciences, Dec. 1969.Google Scholar
  187. 188.
    J. Kuhns. Interrogating a relational data file: Remarks on the admissibility of input queries. Technical report, The Rand Corporation, Nov. 1970.Google Scholar
  188. 189.
    B. Kuipers, J. Paredaens, M. Smits, and J. V. den Bussche. Termination properties of spatial Datalog programs. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 95–109, July 1–2 1996. Also in this collection.Google Scholar
  189. 190.
    L. Laksmanan and N. Shiri. A parametric approach to deductive databases with uncertainty. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 55–73, July 1–2 1996. Also in this collection.Google Scholar
  190. 191.
    D. Laurent and C. Vrain. Learning query rules for optimizing databases with update rules. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 173–192, July 1–2 1996. Also in this collection.Google Scholar
  191. 192.
    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.Google Scholar
  192. 193.
    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.Google Scholar
  193. 194.
    N. Leone and P. Rullo. The safe computation of the well-founded semantics for logic programming. Information Systems, 17(1):17–31, Jan. 1992.Google Scholar
  194. 195.
    N. Leone, P. Rullo, and F. Scarcello. Stable model checking for disjunctive programs. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 281–294, July 1–2 1996. Also in this collection.Google Scholar
  195. 196.
    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.Google Scholar
  196. 197.
    H. Levesque, R. Reiter, Y. Lesperance, F. Lin, and R. Scherl. Golog: A logic programming language for dynamic domains. Journal of Logic Programming, 1996. To appear.Google Scholar
  197. 198.
    H. J. Levesque. Foundations of a functional approach to knowledge representation. Artificial Intelligence, 23:155–212, Mar. 1984.Google Scholar
  198. 199.
    R. Levien. A computer system for inference execution and data retrieval. Comm. ACM, 10:715–721, 1967.Google Scholar
  199. 200.
    R. Levien. Relational data file ii: Implementation. Proc. Third Annual National Colloquium on Information Retrieval, pages 225–241, May 1967.Google Scholar
  200. 201.
    R. Levien. Relational data file: Experience with a system for propositional data storage and inference execution. Technical report, The Rand Corporation, Apr. 1969.Google Scholar
  201. 202.
    R. Levien and M. Maron. Relational Data File: A Tool for Mechanized Inference Execution and Data Retrieval. The Rand Corporation, Dec. 1965.Google Scholar
  202. 203.
    R. Levien and M. Maron. A computer system for inference execution and data retrieval. 10(11):715–721, Nov. 1967. Received September, 1966.Google Scholar
  203. 204.
    A. Levy, A. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS-95, May 1995.Google Scholar
  204. 205.
    A. Levy, A. Rajaraman, and J. Ordille. Querying heterogeneous information sources using source descriptions. In Proc. of the 22nd VLDB Conference, 1996.Google Scholar
  205. 206.
    A. Levy and Y. Sagiv. Semantic query optimization in datalog programs. In Principles of Database Systems 1995 (PODS95), pages 163–173, 1995.Google Scholar
  206. 207.
    F. Lin and R. Reiter. How to progress a database II: The STRIPS connection. Technical report, Dept of Computer Science, University of Toronto, 1993.Google Scholar
  207. 208.
    F. Lin and R. Reiter. How to progress a database (and Why) I: Logical foundations. In KR94, pages 425–436, 1994.Google Scholar
  208. 209.
    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.Google Scholar
  209. 210.
    W. Lipski. On databases with incomplete information. volume 28, pages 41–70. ACM, New York, 1981.Google Scholar
  210. 211.
    K.-C. Liu and R. Sunderraman. Indefinite and maybe information in relational databases. ACM Transactions on Database Systems, 15(1):1–39, 1990.Google Scholar
  211. 212.
    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, Feb. 1990.Google Scholar
  212. 213.
    Y. Liu. Null values in definite programs. In S. Debray and M. Hermenegildo, editors, Proceedings of North American Conference on Logic Programming, pages 273–288, Austin, Texas, Oct. 1990. MIT Press.Google Scholar
  213. 214.
    J. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.Google Scholar
  214. 215.
    J. W. Lloyd and R. W. Topor. A basis for deductive database systems. Journal of Logic Programming, 2(2):93–109, July 1985.Google Scholar
  215. 216.
    J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.Google Scholar
  216. 217.
    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.Google Scholar
  217. 218.
    D. Loveland. Near-Horn prolog. In J. Lassez, editor, Proc. 4th International Conference on Logic Programming, pages 456–459, 1987.Google Scholar
  218. 219.
    D. Loveland, D. Reed, and D. Wilson. Satchmore: Satchmo with relevancy. Technical report, Duke University, Durham, North Carolina, USA, April 1993.Google Scholar
  219. 220.
    B. Ludascher, W. May, and G. Lausen. Nested transactions in a logical language for active rules. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 217–242, July 1–2 1996. Also in this collection.Google Scholar
  220. 221.
    C. Maindreville and E. Simon. Modeling non-deterministic queries and updates in deductive databases. In Proc. of VLDB, 1988.Google Scholar
  221. 222.
    V. W. Marek, A. Nerode, and J. 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.Google Scholar
  222. 223.
    V. W. Marek and Truszczyński. Autoepistemic logic. Journal of the ACM, 38(3):588–619, 1991.Google Scholar
  223. 224.
    C. Martin and J. Sistac. Applying transition rules to bitemporal deductive databases for integrity constraint checking. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 111–128, July 1–2 1996. Also in this collection.Google Scholar
  224. 225.
    J. McCarthy. Circumscription — a form of non-monotonic reasoning. Artificial Intelligence Journal, 13:27–39, 1980.Google Scholar
  225. 226.
    McDermott and J. Doyle. Non-monotonic logic i. Artificial Intelligence Journal, 13:41–72, 1980.Google Scholar
  226. 227.
    J. McSkimin and J. Minker. The use of a semantic network in deductive questionanswering systems. Proc. IJCAI 5, pages 50–58, 1977.Google Scholar
  227. 228.
    J. Melton. An SQL3 snapshot. In Twelfth International Conference on Data Engineering, pages 666–672, 1996.Google Scholar
  228. 229.
    J. Melton and A. R. Simon. Understanding the New SQL: A Complete Guide. Morgan Kaufmann, San Mateo, California, 1993.Google Scholar
  229. 230.
    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.Google Scholar
  230. 231.
    J. Minker. Search strategy and selection function for an inferential relational system. Transactions on Data Base Systems, 3(1):1–31, Mar. 1978.Google Scholar
  231. 232.
    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: Lecture Notes in Computer Science 138, pages 292–308. Springer Verlag, 1982.Google Scholar
  232. 233.
    J. Minker, editor. Proceedings of Workshop on Foundations of Deductive Databases and Logic Programming, Aug. 1986.Google Scholar
  233. 234.
    J. Minker, editor. Foundations of Deductive Databases and Logic Programming. Morgan-Kaufmann, 1988.Google Scholar
  234. 235.
    J. Minker. Perspectives in deductive databases. Journal of Logic Programming, 5:33–60, 1988.Google Scholar
  235. 236.
    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.Google Scholar
  236. 237.
    J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17(2, 3 and 4):95–126, November 1993.Google Scholar
  237. 238.
    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.Google Scholar
  238. 239.
    J. Minker and J.-M. Nicolas. On recursive axioms in deductive databases. Information Systems, 7(4):1–15, 1982.Google Scholar
  239. 240.
    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.Google Scholar
  240. 241.
    J. Minker and A. Rajasekar. Procedural interpretation of non-Horn logic programs. In E. Lusk and R. Overbeek, editors, Proceedings of the Ninth International Conference on Automated Deduction, pages 278–293, Argonne, IL. USA, May 1988.Google Scholar
  241. 242.
    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).Google Scholar
  242. 243.
    J. Minker and A. Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9(1):45–74, July 1990.Google Scholar
  243. 244.
    J. Minker and C. Ruiz. On extended disjunctive logic programs. In J. Komorowski and Z. Raś, 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).Google Scholar
  244. 245.
    J. Minker and C. 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.Google Scholar
  245. 246.
    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.Google Scholar
  246. 247.
    J. Minker and J. 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.Google Scholar
  247. 248.
    J. Minker and G. Zanon. An Extension to Linear Resolution with Selection Function. Information Processing Letters, 14(3):191–194, June 1982.Google Scholar
  248. 249.
    R. Moore. Possible-world semantics for autoepistemic logic. In Proceedings of AAAI Workshop on Non-Monotonic Reasoning, pages 396–401, New Paltz, 1984.Google Scholar
  249. 250.
    R. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence 25, pages 75–94, 1985.Google Scholar
  250. 251.
    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.Google Scholar
  251. 252.
    S. Muggleton and L. D. Raedt. Inductive logic programming: theory and methods. Journal of Logic Programming, 19/20:629–679, May/July 1994.Google Scholar
  252. 253.
    I. 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.Google Scholar
  253. 254.
    J. 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, Mar. 1987.Google Scholar
  254. 255.
    R. Ng and V. Subrahmanian. Probabilistic logic programming. Information and Computation, 101(2):150–201, 1993.Google Scholar
  255. 256.
    J.-M. Nicolas. Logic for improving integrity checking in relational databases. Acta Informatica, 18(3):227–253, Dec. 1979.Google Scholar
  256. 257.
    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.Google Scholar
  257. 258.
    J.-M. Nicolas and J.-C Syre. Natural question — answering and automatic deduction in system syntex. Proc. IFIP Congress 1974, pages 595–599, 1974.Google Scholar
  258. 259.
    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.Google Scholar
  259. 260.
    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, Tübingen, FRG, Dec. 1989. Lecture Notes in Artificial Intelligence, Springer-Verlag.Google Scholar
  260. 261.
    G. Phipps, M. Derr, and K. Ross. Glue-Nail: A deductive database system. In Proc. ACM-SIGMOD'91 Conf., May 1991.Google Scholar
  261. 262.
    G. Piatetsky-Shapiro and W. J. Frawley, editors. Knowledge Discovery in Databases. AAAI Press and MIT Press, Menlo Park, California, 1991.Google Scholar
  262. 263.
    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.Google Scholar
  263. 264.
    S. Pradhan. Combining datalog databases using priorities. In Advances in Data Management '94, pages 355–375. Tata-McGraw Hill, India, 1995.Google Scholar
  264. 265.
    S. Pradhan and J. Minker. Combining datalog databases using priorities. Journal of Intelligent & Cooperative Information Systems, 1995.Google Scholar
  265. 266.
    S. Pradhan, J. Minker, and V. Subrahmanian. Combining databases with prioritized information. Journal of Intelligent Information Systems, 4(3):231–260, May 1995.Google Scholar
  266. 267.
    T. 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.Google Scholar
  267. 268.
    T. 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.Google Scholar
  268. 269.
    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, Oct. 1990.Google Scholar
  269. 270.
    T. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 14:323–357, 1995. Festschrift in honor of Jack Minker.Google Scholar
  270. 271.
    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.Google Scholar
  271. 272.
    T. C. Przymusinski. On the Declarative and Procedural Semantics of Logic Programs. Journal of Automated Reasoning, 5:167–205, 1989.Google Scholar
  272. 273.
    T. C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In D. Warren and P. Szeredi, editors, Proceedings of the 7th International Logic Programming Conference, pages 459–477, Jerusalem, 1990. MIT Press. Extended Abstract.Google Scholar
  273. 274.
    T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.Google Scholar
  274. 275.
    E. Pudilo. Database query evaluation with the STARBASE method. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 335–354, July 1–2 1996. Also in this collection.Google Scholar
  275. 276.
    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.Google Scholar
  276. 277.
    A. Rajasekar, J. Lobo, and J. Minker. Weak generalized closed world assumption. Journal of Automated Reasonig, pages 293–307, 1989.Google Scholar
  277. 278.
    R. Ramakrishnan. Applications of Logic Databases. Kluwer Academic Publishers, 1995.Google Scholar
  278. 279.
    R. Ramakrishnan, D. Srivastava, and S. Sudarshan. CORAL-control, relations and logic. In L.-Y. Yuan, editor, Proceedings of the 18th International Conference on Very Large Databases, pages 238–250, Vancouver, Canada, Aug. 1992.Google Scholar
  279. 280.
    R. Ramakrishnan and J. Ullman. A survey of research on deductive database systems. Journal of Logic Programming, 23(2):125–149, May 1995.Google Scholar
  280. 281.
    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.Google Scholar
  281. 282.
    B. Raphael. A computer program for semantic information retrieval. In M. Minsky, editor, Semantic Information Processing, pages 33–134. MIT Press, 1968.Google Scholar
  282. 283.
    L. Raschid. A semantics for a class of stratified production system programs. Journal of Logic Programming, 21(1):31–57, 1994.Google Scholar
  283. 284.
    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.Google Scholar
  284. 285.
    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.Google Scholar
  285. 286.
    D. Reed, D. Loveland, and B. 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.Google Scholar
  286. 287.
    D. W. Reed and D. 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.Google Scholar
  287. 288.
    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.Google Scholar
  288. 289.
    R. Reiter. A logic for default reasoning. Artificial Intelligence Journal, 13:81–132, 1980.Google Scholar
  289. 290.
    R. Reiter. Towards A Logical Reconstruction of Relational Database Theory. In M. Brodie, J. Mylopoulos, and J. Schmit, editors, On Conceptual Modelling, pages 163–189. Springer-Verlag Pub., New York, 1984.Google Scholar
  290. 291.
    R. Reiter. A sound and sometimes complete query evaluation algorithm for relational databases with null values. J.ACM, 33(2):349–370, Apr. 1986.Google Scholar
  291. 292.
    R. 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, Mar. 1988. Morgan Kaufmann Publishers, Inc.Google Scholar
  292. 293.
    R. Reiter. On asking what a database knows. In J. Lloyd, editor, Computational Logic, Basic research Series. Springer-Verlag Publishers, 1990. DG XIII Commission of the European Communities.Google Scholar
  293. 294.
    J. Robinson. A machine-oriented logic based on the resolution principle. J.ACM, 12(1), Jan. 1965.Google Scholar
  294. 295.
    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.Google Scholar
  295. 296.
    K. 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.Google Scholar
  296. 297.
    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, Dec. 1989.Google Scholar
  297. 298.
    K. Ross. Modular stratification and magic sets for datalog programs with negation. In Proc. ACM Symp. on Principles of Database Systems, April 1990.Google Scholar
  298. 299.
    K. Ross. Modular acylicity and tail recursion in logic programs. In Proc. of the Tenth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS'91), pages 92–101, 1991.Google Scholar
  299. 300.
    K. Ross and R. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4(2):397–424, December 1988.Google Scholar
  300. 301.
    C. Ruiz and J. Minker. Computing stable and partial stable models of extended disjunctive logic programs. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, pages 205–229. Lecture Notes in Computer Science 927. Springer-Verlag, 1995.Google Scholar
  301. 302.
    D. Saccà. The expressive power of stable models for bound and unbound DATA-LOG queries. The Journal of Computer and System Sciences, 1996. To appear.Google Scholar
  302. 303.
    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.Google Scholar
  303. 304.
    D. Sacca and C. Zaniolo. The generalized counting method for recursive logic queries. Theoretical Computer Science, 62, 1988.Google Scholar
  304. 305.
    D. Saccà and C. Zaniolo. Stable models and non-determinism to logic with negation. In Proc. Workshop on Logic Programming and Nonmonotonic Reasoning, pages 87–101, 1991.Google Scholar
  305. 306.
    F. Sadri and R. Kowalski. Database integrity, chapter 9, pages 313–362. Morgan Kaufmann Publishers, 1988.Google Scholar
  306. 307.
    K. Sagonas, T. Swift, and D. Warren. The limits of fixed-order computation. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 355–374, July 1–2 1996. Also in this collection.Google Scholar
  307. 308.
    C. Sakama. Possible model semantics for disjunctive databases. In Proc. First International Conference on Deductive and Object Oriented Databases, pages 337–351, 1989.Google Scholar
  308. 309.
    E. Sandewall. Features and fluents: A systemetic approach to the representation of knowledge about dynamical systems. Technical report, Institutionen for datavetenskap, Universitet och Tekniska hogskolan i Linkoping, Sweden, 1992.Google Scholar
  309. 310.
    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.Google Scholar
  310. 311.
    D. Savitt, H. Love, and R. Troop. ASP: A new concept in language and machine organization. In 1967 Spring Joint Computer Conference, pages 87–102, 1967.Google Scholar
  311. 312.
    J. 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.Google Scholar
  312. 313.
    J. Schlipf. Complexity and undecideability results for logic programming. Annals of Mathematics and Artificial Intelligence, 15(3–4):257–288, Dec 1995.Google Scholar
  313. 314.
    B. Selman and H. Kautz. Knowledge compilation using Horn approximations. In Proc. of AAAI-91, pages 904–909, 1991.Google Scholar
  314. 315.
    B. Selman and H. Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 1996. To appear.Google Scholar
  315. 316.
    B. Selman and H. Levesque. Abductive and default reasoning: A computational core. In Proceedings AAAI-90, pages 343–348, Boston, MA, 1989.Google Scholar
  316. 317.
    S. Shapiro and D. McKay. Inferences with recursion. In Proceedings of the 1st Annual National Conference on Artificial Intelligence, 1980.Google Scholar
  317. 318.
    J. Shepherdson. Negation in Logic Programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 19–88. Morgan Kaufman Pub., 1988.Google Scholar
  318. 319.
    S. Sickel. A search technique for clause interconnectivity graphs. IEEE Transactions on Computers, C-25(8):823–835, Aug. 1976.Google Scholar
  319. 320.
    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.Google Scholar
  320. 321.
    B. Smith and D. Loveland. A simple near-Horn Prolog interpreter. In R. Kowalski and K. Bowen, editors, Proc. 5th International Conference and Symposium on Logic Programming, pages 794–809, Seattle, Washington, Aug. 1988.Google Scholar
  321. 322.
    R. Smullyan. On definability by recursion (abstract). Bull, AMS62, page 601, 1956.Google Scholar
  322. 323.
    R. M. Smullyan. Elementary formal system (abstract). Bull, AMS62, page 600, 1956.Google Scholar
  323. 324.
    R. Snodgrass. The temporal query language TQuel. ACM Trans. Database Syst., 12(2):247–298, June 1987.Google Scholar
  324. 325.
    R. Snodgrass, editor. Data Engineering. IEEE Computer Society, December 1988. Special issue on temporal databases.Google Scholar
  325. 326.
    R. Snodgrass and E. McKenzie. Research concerning time in databases. SIGMOD Record, 15(4):19–52, December 1986.Google Scholar
  326. 327.
    M. Stickel. A PROLOG technology theorem prover: Implementation by an extended PROLOG compiler. Journal of Automated Reasoning, 4(4):353–380, 1988.Google Scholar
  327. 328.
    V. Subrahmanian, S. Adali, A. Brink, R. Emery, J. Lu, A. Rajput, T. Rogers, and R. Ross. Hermes: A heterogeneous reasoning and mediator system, 1994. Available from (http://www.cs.umd.edu/projects/hermes/overview/paper.Google Scholar
  328. 329.
    V. Subrahmanian and S. Jajodia. Multimedia Database Systems. Springer Verlag, 1995.Google Scholar
  329. 330.
    V. Subrahmanian and C. Ward. A deductive database approach to planning in uncertain environments. In D. Pedreschi and C. Zaniolo, editors, Logic in Databases (LID'96), pages 77–92, July 1–2 1996. Also in this collection.Google Scholar
  330. 331.
    M. A. Suchenek. Minimal models for closed world databases. In Z. Ras, editor, Proc. of ISM1S 4, pages 515–522. Elsvier Sience Publishing Co. Inc., 1989.Google Scholar
  331. 332.
    T. Swift and D. Warren. An abstract machine for SLG resolution: definite programs. In Proc. of the 1994 ILPS, pages 633–652. The MIT Press, 1994.Google Scholar
  332. 333.
    T. V. 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).Google Scholar
  333. 334.
    X. A. I. Technologies. HIPAC: a research project in active, time-constrained databases. Technical Report 187, Xerox Advanced Information Technologies, 1989.Google Scholar
  334. 335.
    D. Tsichritzis and F. Lochovsky. Hierarchic data-base model: A survey. ACM Computing Surveys, 8(1):67–103, March 1976.Google Scholar
  335. 336.
    S. Tsur and C. Zaniolo. LDL: A logic-based data-language. In Proceedings of the 12th VLDB Conf, August 1986.Google Scholar
  336. 337.
    J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Principles of Computer Science Series. Computer Science Press, Incorporated, Rockville, Maryland, 1988.Google Scholar
  337. 338.
    J. 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.Google Scholar
  338. 339.
    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.Google Scholar
  339. 340.
    M. van Emden and R. Kowalski. The Semantics of Predicate Logic as a Programming Language. J.ACM, 23(4):733–742, 1976.Google Scholar
  340. 341.
    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.Google Scholar
  341. 342.
    M. Vardi. The complexity of relational query languages. In Proc. of the 14th ACM Symposium on Theory of Computing, pages 137–146, May 1982.Google Scholar
  342. 343.
    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.Google Scholar
  343. 344.
    L. Vieille. Recursive axioms in deductive databases: the Query/SubQuery approach. In Proc. 1st. Int. Conf. on Expert Database Systems, April 1986.Google Scholar
  344. 345.
    L. Vieille. Database-complete proof procedures based on SLD-resolutions. In Proc. 4th Int. Conf. on Logic Programming, May 1987.Google Scholar
  345. 346.
    L. Vieille. Recursive query processing: The power of logic. Theoretical Computer Science, 69, 1989.Google Scholar
  346. 347.
    L. Vieille, P. Bayer, V. Kuechenhoff, and A. Lefebvre. EKS-V1, a short overview. AAAI'90 Workshop on Knowledge Base Management Systems. July 1990Google Scholar
  347. 348.
    L. Vielle, P. Bayer, and V. Kuechenhoff. Integrity checking and materialized view handling by update propagation in the EKS-V1 system. Technical report, ECRC, 1991. to appear as a chapter in the book “Materialized Views”, A. Gupta and I. Mumick (eds), MIT Press, Cambridge, MA, USA, 1996.Google Scholar
  348. 349.
    A. Yahya and L. Henschen. Deduction in Non-Horn Databases. J. Automated Reasoning, 1(2):141–160, 1985.Google Scholar
  349. 350.
    J.-H. You and L. Yuan. Three-valued formalization of logic programming. In Proceedings of the 9th ACM PODS, pages 172–182, 1990.Google Scholar
  350. 351.
    J.-H. You and L. Yuan. A three-valued semantics for deductive databases and logic programs. Journal of Computer and System Sciences, 49:334–361, 1994.Google Scholar
  351. 352.
    J.-H. You and L. Yuan. On the equivalence of semantics for normal logic programs. Journal of Logic Programming, pages 211–222, 1995.Google Scholar
  352. 353.
    L. Yuan and J.-H. You. Autoepistemic circumscription and logic programming. Journal of Automated Reasoning, 10:143–160, 1993.Google Scholar
  353. 354.
    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, Mar. 1989.Google Scholar
  354. 355.
    C. Zaniolo. Database relations with null values. JCSS, 28:142–166, 1984.Google Scholar
  355. 356.
    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.Google Scholar
  356. 357.
    C. Zaniolo. Active database rules with transaction-conscious stable models semantics. In Proceedings of DOOD 1996, pages 55–72, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jack Minker
    • 1
  1. 1.Department of Computer Science Institute for Advanced Computer StudiesUniversity of MarylandCollege ParkUSA

Personalised recommendations