Skip to main content
Springer Nature Link
Log in

Prolegomena to logic programming for non-monotonic reasoning

  • Introduction
  • Conference paper
  • First Online:
Non-Monotonic Extensions of Logic Programming (NMELP 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1216))

Abstract

The present prolegomena consist, as all indeed do, in a critical discussion serving to introduce and interpret the extended works that follow in this book. As a result, the book is not a mere collection of excellent papers in their own specialty, but provides also the basics of the motivation, background history, important themes, bridges to other areas, and a common technical platform of the principal formalisms and approaches, augmented with examples.

In the introduction we whet the reader's interest in the field of logic programming and non-monotonic reasoning with the promises it offers and with its outstanding problems too. There follows a brief historical background to logic programming, from its inception to actuality, and its relationship to non-monotonic formalisms, stressing its semantical and procedural aspects.

The next couple of sections provide motivating examples and an overview of the main semantics paradigms for normal programs (stable models and well-founded) and for extended logic programs (answer-sets, e-answer-sets, Nelson's strong negation, and well-founded semantics with pseudo and with explicit negation).

A subequent section is devoted to disjunctive logic programs and its various semantical proposals.

To conclude, a final section on implementation gives pointers to available systems and their sites.

We leave out important concerns, such as paraconsistent semantics, contradiction removal, and updates. Hopefully they will be included in the next book in this series. But an extensive set of references allows the reader to delve into the specialized literature.

For other recent relevant complementary overviews in this area we refer to [AP96,BDK97,BD96b,Min96,Dix95c].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Apt and M. Bezem. Acyclic programs. New Generation Computing, 29(3):335–363, 1991.

    Google Scholar 

  2. Krysztof R. Apt and Roland N. Bol. Logic Programming and Negation: A Survey. Journal of Logic Programming, 19–20:9–71, 1994.

    Article  Google Scholar 

  3. 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–142. Morgan Kaufmann, 1988.

    Google Scholar 

  4. Chandrabose Aravindan, Jürgen Dix, and Ilkka Niemelä. The DisLoP-project. Technical Report TR 1/97, University of Koblenz, Department of Computer Science, Rheinau 1, January 1997.

    Google Scholar 

  5. J. J. Alferes, C. V. Damásio, and L. M. Pereira. A logic programming system for non-monotonic reasoning. Journal of Automated Reasoning, 14(1):93–147, 1995.

    Article  Google Scholar 

  6. Jose Julio Alferes and Luiz Moniz Pereira, editors. Reasoning with Logic Programming, LNAI 1111, Berlin, 1996. Springer.

    Google Scholar 

  7. J. J. Alferes, L. M. Pereira, and T. Przymusinski. “Classical” negation in non monotonic reasoning and logic programming. In H. Kautz and B. Selman, editors, 4th Int. Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, USA, January 1996. Florida Atlantic University.

    Google Scholar 

  8. Roland N. Bol and L. Degerstedt. Tabulated resolution for well-founded semantics. In Proc. Int. Logic Programming Symposium'93, Cambridge, Mass., 1993. MIT Press.

    Google Scholar 

  9. Stefan Brass and Jürgen Dix. A disjunctive semantics based on unfolding and bottom-up evaluation. In Bernd Wolfinger, editor, Innovationen bei Rechen-und Kommunikationssystemen, (IFIP '94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83–91, Berlin, 1994. Springer.

    Google Scholar 

  10. Stefan Brass and Jürgen 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, LNAI 927, pages 127–155. Springer, Berlin, 1995.

    Google Scholar 

  11. Stefan Brass and Jürgen Dix. Characterizing D-WFS: Confluence and Iterated GCWA. In L.M. Pereira J.J. Alferes and E. Orlowska, editors, Logics in Artificial Intelligence (JELIA '96), LNCS 1126, pages 268–283. Springer, 1996. (Extended version will appear in the Journal of Automated Reasoning in 1997).

    Google Scholar 

  12. Gerhard Brewka and Jürgen Dix. Knowledge representation with logic programs. Technical report, Tutorial Notes of the 12th European Conference on Artificial Intelligence (ECAI '96), 1996. Also appeared as Technical Report 15/96, Dept. of CS of the University of Koblenz-Landau. Will appear as Chapter 6 in Handbook of Philosophical Logic, 2nd edition (1998), Volume 6, Methodologies.

    Google Scholar 

  13. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, forthcoming, 1997. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pages 85–98, 1995. Springer.).

    Google Scholar 

  14. Stefan Brass and Jürgen Dix. Semantics of Disjunctive Logic Programs Based on Partial Evaluation. Journal of Logic Programming, accepted for publication, 1997. (Extended abstract appeared in: Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation, Proceedings of the 12-th International Logic Programming Conference, Tokyo, pages 199–213, 1995. MIT Press.).

    Google Scholar 

  15. Gerd Brewka, Jürgen Dix, and Kurt Konolige. Nonmonotonic Reasoning: An Overview. CSLI Lecture Notes 73. CSLI Publications, Stanford, CA, 1997.

    Google Scholar 

  16. Stefan Brass, Jürgen Dix, Ilkka Niemelä, and Teodor. C. Przymusinski. Comparison and Efficient Computation of the Static and the Disjunctive WFS. Technical report, University of Koblenz, Department of Computer Science, Rheinau 1, January 1997. submitted to a conference. Preliminary version appeared as Technical Report 2/96.

    Google Scholar 

  17. Stefan Brass, Jürgen Dix, and Teodor. C. Przymusinski. Super Logic Programs. In L. C. Aiello, J. Doyle, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR '96), pages 529–541. San Francisco, CA, Morgan Kaufmann, 1996.

    Google Scholar 

  18. N. Bidoit and C. Froidevaux. General logic databases and programs: default logic semantics and stratification. Journal of Information and Computation, 1988.

    Google Scholar 

  19. P. Baumgartner and U. Furbach. Model Elimination without Contrapositives and its Application to PTTP. Journal of Automated Reasoning, 13:339–359, 1994. Short version in: Proceedings of CADE-12, Springer LNAI 814, 1994, pp 87–101.

    Article  Google Scholar 

  20. Peter Baumgartner, Ulrich Furbach, and Ilkka Niemelä. Hyper tableaux. In L.M. Pereira J.J. Alferes and E. Orlowska, editors, Logics in Artificial Intelligence (JELIA '96), LNCS 1126, pages 1–17. Springer, 1996.

    Google Scholar 

  21. Stefan Brass and Udo W. Lipeck. Bottom-up query evaluation with partially ordered defaults. In Stefano Ceri, Katsumi Tanaka, and Shalom Tsur, editors, Deductive and Object-Oriented Databases, Third Int. Conf., (DOOD'93), number 760 in LNCS, pages 253–266, Berlin, 1993. Springer.

    Google Scholar 

  22. Chitta Baral, Jorge Lobo, and Jack Minker. Generalized Disjunctive Well-founded Semantics for Logic Programs: Procedural Semantics. In Z.W. Ras, M. Zemankova, and M.L Emrich, editors, Proceedings of the 5th Int. Symp. on Methodologies for Intelligent Systems, Knoxville, TN, October 1990, pages 456–464. North-Holland, 1990.

    Google Scholar 

  23. Colin Bell, Anil Nerode, Raymond T. Ng, and V. S. Subrahmanian. Implementing Stable Semantics by Linear Programming. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Second International Workshop, pages 23–42, Cambridge, Mass., July 1993. Lisbon, MIT Press.

    Google Scholar 

  24. Colin Bell, Anil Nerode, Raymond T. Ng, and V. S. Subrahmanian. Mixed Integer Programming Methods for Computing Non-Monotonic Deductive Databases. Journal of the ACM, 41(6):1178–1215, November 1994.

    Article  Google Scholar 

  25. François Bry. Logic programming as constructivism: A formalization and its application to databases. In Proc. of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'89), pages 34–50, 1989.

    Google Scholar 

  26. C. Baral and V. S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, LP & NMR, pages 69–86. MIT Press, 1991.

    Google Scholar 

  27. A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un système de communication homme-machine en français. Technical report, Groupe de Intelligence Artificielle Universite de Aix-Marseille II, 1973.

    Google Scholar 

  28. Stefania Costantini and Gaetano A. Lanzarone. Static Semantics as Program Transformation and Well-founded Computation. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 156–180. Springer, Berlin, 1995.

    Google Scholar 

  29. Keith L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data-Bases, pages 293–322. Plenum, New York, 1978.

    Google Scholar 

  30. Weidong Chen, Terrance Swift, and David S. Warren. Efficient Top-Down Computation of Queries under the Well-Founded Semantics. Journal of Logic Programming, 24(3):219–245, 1995.

    Article  Google Scholar 

  31. Weidong Chen and David S. Warren. A Goal Oriented Approach to Computing The Well-founded Semantics, Journal of Logic Programming, 17:279–300, 1993.

    Article  Google Scholar 

  32. Weidong Chen and David S. Warren. Computing of Stable Models and its Integration with Logical Query Processing. IEEE Transactions on Knowledge and Data Engineering, 17:279–300, 1995.

    Google Scholar 

  33. Weidong Chen and David S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20–74, January 1996.

    Article  Google Scholar 

  34. C. V. Damásio. Paraconsistent Extended Logic Programming with Constraints. PhD thesis, Universidade Nova de Lisboa, October 1996.

    Google Scholar 

  35. J. Dix and U. Furbach. The DFG-Project DisLoP on Disjunctive Logic Programming. Computational Logic, 2:89–90, 1996.

    Google Scholar 

  36. J. Dix, U. Furbach, and A. Nerode, editors. Logic Programming and Non-monotonic Reasoning, LNAI to appear, Berlin, 1997. Springer.

    Google Scholar 

  37. Roy Dyckhoff, Heinrich Herre, and Peter Schroeder-Heister, editors. Extensions of Logic Programming, LNAI 1050, Berlin, 1996. Springer.

    Google Scholar 

  38. J. Dix. Classifying semantics of logic programs. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, LP & NMR, pages 166–180. MIT Press, 1991.

    Google Scholar 

  39. J. Dix. A framework for representing and characterizing semantics of logic programs. In B. Nebel, C. Rich, and W. Swartout, editors, 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning. Morgan Kaufmann, 1992.

    Google Scholar 

  40. Jürgen 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 

  41. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, XXII(3):227–255, 1995.

    Google Scholar 

  42. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257–288, 1995.

    Google Scholar 

  43. Jürgen Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In Andre Fuhrmann and Hans Rott, editors, Logic, Action and Information — Essays on Logic in Philosophy and Artificial Intelligence, pages 241–327. DeGruyter, 1995.

    Google Scholar 

  44. Jürgen Dix, Donald Loveland, Jack Minker, and David. S. Warren. Disjunctive Logic Programming and databases: Nonmonotonic Aspects. Technical Report Dagstuhl Seminar Report 150, IBFI GmbH, Schloß Dagstuhl, 1996.

    Google Scholar 

  45. Jürgen Dix and Martin Müller. Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs. In Proc. of the Workshop W1, Structural Complexity and Recursion-theoretic Methods in Logic Programming, following the JICSLP '92, pages 15–28. H. Blair and W. Marek and A. Nerode and J. Remmel, November 1992. also available as Technical Report 13/93, University of Koblenz, Department of Computer Science.

    Google Scholar 

  46. Jürgen Dix and Martin Müller. Implementing Semantics for Disjunctive Logic Programs Using Fringes and Abstract Properties. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Second International Workshop, pages 43–59, Cambridge, Mass., July 1993. Lisbon, MIT Press.

    Google Scholar 

  47. Lars Degerstedt and Ulf Nilsson. Magic Computation of Well-founded Semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Non-monotonic Extensions of Logic Programming, LNAI 927, pages 181–204. Springer, Berlin, 1995.

    Google Scholar 

  48. J. Dix, L. Pereira, and T. Przymusinski, editors. Non-Monotonic Extensions of Logic Programming, LNAI 927, Berlin, 1995. Springer.

    Google Scholar 

  49. P. M. Dung. Negation as hypotheses: An abductive framework for logic programming. In K. Furukawa, editor, 8th Int. Conf. on LP, pages 3–17. MIT Press, 1991.

    Google Scholar 

  50. Thomas Eiter and Georg Gottlob. Propositional Circumscription and Extended Closed World Reasoning are Π P2 -complete. Theoretical Computer Science, 144(2):231–245, Addendum: vol. 118, p. 315, 1993, 1993.

    Article  Google Scholar 

  51. T. Eiter, G. Gottlob, J. Lu, and V. S. Subrahmanian. Computing Non-Ground Representations of Stable Models. Technical report, University of Maryland, 1996.

    Google Scholar 

  52. Thomas Eiter, Georg Gottlob, and Heikki Mannila. Expressive Power and Complexity of Disjunctive DATALOG. In Proceedings of Workshop on Logic Programming with Incomplete Information, Vancouver Oct. 1993, following ILPS' 93, pages 59–79, 1993.

    Google Scholar 

  53. Thomas Eiter, Georg Gottlob, and Heikki Mannila. Adding disjunction to datalog. In Proc. of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database. Systems (PODS'94), pages 267–278, 1994.

    Google Scholar 

  54. M. Van Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 4(23):733–742, 1976.

    Article  Google Scholar 

  55. M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of LP, 2(4):295–312, 1985.

    Google Scholar 

  56. J. A. Fernández, J. Lobo, J. Minker, and V.S. Subrahmanian. Disjunctive LP + Integrity Constraints=Stable Model Semantics. Annals of Mathematics and Artificial Intelligence, 8(3–4), 1993.

    Google Scholar 

  57. J. A. Fernández and J. Minker. Bottom-Up Computation of Perfect Models for Disjunctive Theories. Journal of Logic Programming, 25(1):33–51, 1995.

    Article  Google Scholar 

  58. M. Gelfond. On stratified autoepistemic theories. In AAAI'87, pages 207–211. Morgan Kaufmann, 1987.

    Google Scholar 

  59. A. Van Gelder. The alternating fixpoint of logic programs with negation. In 8th Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD, 1989.

    Google Scholar 

  60. A. Van Gelder. Negation as failure using tight derivations for general logic programs. Journal of LP, 6(1):109–133, 1989.

    Google Scholar 

  61. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. A. Bowen, editors, 5th Int. Conf. on LP, pages 1070–1080. MIT Press, 1988.

    Google Scholar 

  62. Michael Gelfond and Vladimir Lifschitz. Compiling Circumscriptive Theories into Logic Programs. In Reinfrank, de Kleer, Ginsberg, and Sandewall, editors, Non-Monotonic Reasoning, LNAI 346, pages 74–99, Berlin, January 1989. Springer.

    Google Scholar 

  63. Michael Gelfond and Vladimir Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365–387, 1991. (Extended abstract appeared in: Logic Programs with Classical Negation. Proceedings of the 7-th International Logic Programming Conference, Jerusalem, pages 579–597, 1990. MIT Press.).

    Google Scholar 

  64. M. Gelfond and V. Lifschitz. Representing actions in extended logic programs. In K. Apt, editor, Int. Joint Conf. and Symp. on LP, pages 559–573. MIT Press, 1992.

    Google Scholar 

  65. H. Gallaire, J. Minker, and J. Nicolas. Logic and databases: a deductive approach. ACM Computing Surveys, 16:153–185, 1984.

    Article  Google Scholar 

  66. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.

    Google Scholar 

  67. HMSO. British Nationality Act. Her Majesty's Stationery Office, 1981.

    Google Scholar 

  68. Katsumi Inoue, M. Koshimura, and R. Hasegawa. Embedding negation-as-failure into a model generation theorem prover. In Deepak Kapur, editor, Automated Deduction — CADE-11, Number 607 in LNAI, Berlin, 1992. Springer.

    Google Scholar 

  69. K. Inoue. Extended logic programs with default assumptions. In Koichi Furukawa, editor, 8th Int. Conf. on LP, pages 490–504, Cambridge, Mass., 1991. MIT Press.

    Google Scholar 

  70. R. Kowalski and D. Khuener. Linear resolution with selection function. Artificial Intelligence, 5:227–260, 1971.

    Article  Google Scholar 

  71. Vadim Kagan, Anil Nerode, and V. S. Subrahmanian. Computing Definite Logic Programs by Partial Instantiation. Annals of Pure and Applied Logic, 67:161–182, 1994.

    Article  Google Scholar 

  72. Vadim Kagan, Anil Nerode, and V. S. Subrahmanian. Computing Minimal Models by Partial Instantiation. Theoretical Computer Science, 155:157–177, 1995.

    Article  Google Scholar 

  73. R.A. Kowalski. Predicate logic as a programming language. In Proceeedings IFIP' 74, pages 569–574. North Holland Publishing Company, 1974.

    Google Scholar 

  74. R. Kowalski. Algorithm=logic + control. Communications of the ACM, 22:424–436, 1979.

    Article  Google Scholar 

  75. R. Kowalski. The treatment of negation in logic programs for representing legislation. In 2nd Int. Conf. on AI and Law, pages 11–15, 1989.

    Google Scholar 

  76. R. Kowalski. Problems and promises of computational logic. In John W. Lloyd, editor, Computational Logic, Basic Research Series, pages 1–36, Berlin, 1990. Springer.

    Google Scholar 

  77. R. Kowalski. Legislation as logic programs. In Logic Programming in Action, pages 203–230. Springer-Verlag, 1992.

    Google Scholar 

  78. R. Kowalski and F. Sadri. Logic programs with exceptions. In Warren and Szeredi, editors, 7th Int. Conf. on LP, Cambridge, Mass., 1990. MIT Press.

    Google Scholar 

  79. David B. Kemp, Peter J. Stuckey, and Divesh Srivastava. Magic Sets and Bottom-Up Evaluation of Well-Founded Models. In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 Int. Symposium on Logic Programming, pages 337–351. MIT, June 1991.

    Google Scholar 

  80. Kenneth Kunen. Negation in Logic Programming. Journal of Logic Programming, 4:289–308, 1987.

    Article  Google Scholar 

  81. Kenneth Kunen. Some Remarks on the completed Database. Fundamenta Informaticae, XIII:35–49, 1990.

    Google Scholar 

  82. H. Levesque. Making believers out of computers. Artificial Intelligence, 30:81–107, 1986.

    Article  Google Scholar 

  83. W. Lipski, Jr.. On semantic issues connected with incomplete information databases. ACM Transactions on Database Systems, 4:262–296, 1979.

    Article  Google Scholar 

  84. John W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd edition.

    Google Scholar 

  85. Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. MIT-Press, 1992.

    Google Scholar 

  86. John W. Lloyd and Rodney W. Topor. A basis for deductive database systems. The Journal of Logic Programming, 2:93–109, 1985.

    Article  Google Scholar 

  87. John W. Lloyd and Rodney W. Topor. A basis for deductive database systems II. The Journal of Logic Programming, 3:55–67, 1986.

    Article  Google Scholar 

  88. Jack Minker. Foundations of Deductive Databases. Morgan Kaufmann, 95 First Street, Los Altos, CA 94022, 1st edition, 1988.

    Google Scholar 

  89. Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

    Google Scholar 

  90. Jack Minker. Logic and databases: A 20 year retrospective. In Dino Pedreschi and Carlo Zaniolo, editors, Proceedings of the International Workshop on Logic in Databases (LID), LNCS 1154, pages 3–58. Springer, Berlin, 1996.

    Google Scholar 

  91. W. Marek, A. Nerode, and M. Truszczyński, editors. Logic Programming and Nonmonotonic Reasoning, LNAI 928, Berlin, 1995. Springer.

    Google Scholar 

  92. L. Monteiro. Notes on the negation in logic programs. Technical report, Dep. of Computer Science, Univerdade Nova de Lisboa, 1992. Course Notes, 3rd Advanced School on AI, Azores, Portugal, 1992.

    Google Scholar 

  93. R. Moore. Semantics considerations on nonmonotonic logic. Artificial Intelligence, 25:75–94, 1985.

    Article  Google Scholar 

  94. Jack Minker and Carolina Ruiz. 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, LNAI 927, pages 205–229. Springer, Berlin, 1995.

    Google Scholar 

  95. W. Marek and M. Truszczynski. Autoepistemic logics. Journal of the ACM, 38(3):588–619, 1991.

    Article  Google Scholar 

  96. Martin Müller. Examples and Run-Time Data from KORF, 1992.

    Google Scholar 

  97. D. Nelson. Constructible falsity. JSL, 14:16–26, 1949.

    Google Scholar 

  98. A. Nerode, W. Marek, and V. S. Subrahmanian, editors. Logic Programming and Non-monotonic Reasoning: Proceedings of the First Int. Ws., Washington D.C., USA, 1991. The MIT Press.

    Google Scholar 

  99. Anil Nerode, Raymond T. Ng, and V.S. Subrahmanian. Computing Circumscriptive Deductive Databases. CS-TR 91-66, Computer Science Dept., Univ. Maryland, University of Maryland, College Park, Maryland, 20742, USA, December 1991.

    Google Scholar 

  100. Ilkka Niemelä and Patrik Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289–303, Bonn, Germany, September 1996. The MIT Press.

    Google Scholar 

  101. L. M. Pereira and J. J. Alferes. Well founded semantics for logic programs with explicit negation. In B. Neumann, editor, European Conf. on AI, pages 102–106. John Wiley & Sons, 1992.

    Google Scholar 

  102. L. M. Pereira, J. J. Alferes, and J. N. Aparício. A practical introduction to well founded semantics. In B. Mayoh, editor, Scandinavian Conf. on AI. IOS Press, 1991.

    Google Scholar 

  103. L. M. Pereira, J. N. Aparício, and J. J. Alferes. Counterfactual reasoning based on revising assumptions. In Ueda and Saraswat, editors, Int. LP Symp., pages 566–577. MIT Press, 1991.

    Google Scholar 

  104. L. M. Pereira, J. N. Aparício, and J. J. Alferes. Nonmonotonic reasoning with well founded semantics. In Koichi Furukawa, editor, 8th Int. Conf. on LP, pages 475–489. MIT Press, 1991.

    Google Scholar 

  105. L. M. Pereira, J. N. Aparício, and J. J. Alferes. Logic programming for nonmonotonic reasoning. In Applied Logic Conf. Preproceedings by ILLC, Amsterdam, 1992. To appear in Springer-Verlag LNAI.

    Google Scholar 

  106. L. M. Pereira, J. N. Aparício, and J. J. Alferes. Non-Monotonic Reasoning with Logic Programming. Journal of Logic Programming, 17:227–264, 1993.

    Article  Google Scholar 

  107. L. M. Pereira, C. Damásio, and J. J. Alferes. Diagnosis and debugging as contradiction removal. In L. M. Pereira and A. Nerode, editors, 2nd Int. Ws. on LP & NMR, pages 316–330, Cambridge, Mass., 1993. MIT Press.

    Google Scholar 

  108. L. M. Pereira and A. Nerode, editors. Logic Programming and Non-monotonic Reasoning: Proceedings of the Second Int. Ws., Lisboa, Portugal, 1993. MIT Press.

    Google Scholar 

  109. H. Przymusinska and T. Przymusinski. Weakly perfect model semantics. In R. Kowalski and K. A. Bowen, editors, 5th Int. Conf. on LP, pages 1106–1122. MIT Press, 1988.

    Google Scholar 

  110. H. Przymusinska and T. Przymusinski. Semantic issues in deductive databases and logic programs. In R. Banerji, editor, Formal Techniques in AI, a Sourcebook, pages 321–367. North Holland, 1990.

    Google Scholar 

  111. T. Przymusinski. Every logic program has a natural stratification and an iterated fixed point model. In 8th Symp. on Principles of Database Systems. ACM SIGACT-SIGMOD, 1989.

    Google Scholar 

  112. T. Przymusinski. Three-valued non-monotonic formalisms and logic programming. In R. Brachman, H. Levesque, and R. Reiter, editors, 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 341–348. Morgan Kaufmann, 1989.

    Google Scholar 

  113. Teodor Przymusinski. On the declarative and procedural Semantics of logic Programs. Journal of Automated Reasoning, 5:167–205, 1989.

    Article  Google Scholar 

  114. T. Przymusinski. Extended stable semantics for normal and disjunctive programs. In Warren and Szeredi, editors, 7th Int. Conf. on LP, pages 459–477, Cambridge, Mass., 1990. MIT Press.

    Google Scholar 

  115. T. Przymusinski. Autoepistemic logic of closed beliefs and logic programming. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, LP & NMR, pages 3–20. MIT Press, 1991.

    Google Scholar 

  116. Teodor Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing Journal, 9:401–424, 1991. (Extended abstract appeared in: Extended stable semantics for normal and disjunctive logic programs. Proceedings of the 7-th International Logic Programming Conference, Jerusalem, pages 459–477, 1990. MIT Press, Cambridge, Mass.).

    Google Scholar 

  117. Teodor Przymusinski. Stationary Semantics for Normal and Disjunctive Logic Programs. In C. Delobel, M. Kifer, and Y. Masunaga, editors, DOOD '91, Proceedings of the 2nd International Conference, Berlin, December 1991. Muenchen, Springer. LNCS 566.

    Google Scholar 

  118. Teodor Przymusinski. Semantics of normal and disjunctive logic programs: A unifying framework. In J. Dix, L. Pereira, and T. Przymusinski, editors, Proceedings of the Workshop on Non-Monotonic Extensions of Logic Programming at the Eleventh International Logic Programming Conference, ICLP'94, Santa Margherita Ligure, Italy, June 1994, pages 43–67. Springer, 1995.

    Google Scholar 

  119. Teodor Przymusinski. Static Semantics For Normal and Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 14:323–357, 1995.

    Article  Google Scholar 

  120. D. Pearce and G. Wagner. Reasoning with negative information I: Strong negation in logic programs. In L. Haaparanta, M. Kusch, and I. Niiniluoto, editors, Language, Knowledge and Intentionality, pages 430–453. Acta Philosophica Fennica 49, 1990.

    Google Scholar 

  121. R. Reiter. On closed-world data bases. In H. Gallaire and J. Minker, editors, Logic and DataBases, pages 55–76. Plenum Press, 1978.

    Google Scholar 

  122. Raymond Reiter. On closed world data bases. In Hervé Gallaire and Jack Minker, editors, Logic and Data Bases, pages 55–76, New York, 1978. Plenum.

    Google Scholar 

  123. Raymond Reiter. A Logic for Default-Reasoning. Artificial Intelligence, 13:81–132, 1980.

    Article  Google Scholar 

  124. R. Reiter. Towards a logical reconstruction of relational database theory. In M. Brodie and J. Mylopoulos, editors, On Conceptual Modelling, pages 191–233. Springer-Verlag, 1984.

    Google Scholar 

  125. Stuart Russel and Peter Norvig. Artificial Intelligence — A Modern Approach. Prentice Hall, New Jersey 07458, 1995.

    Google Scholar 

  126. Kenneth A. Ross. A procedural semantics for well-founded negation in logic programs. Journal of Logic Programming, 13:1–22, 1992.

    Article  MathSciNet  Google Scholar 

  127. Kenneth A. Ross and Rodney A. Topor. Inferring negative Information from disjunctive Databases. Journal of Automated Reasoning, 4:397–424, 1988.

    Article  Google Scholar 

  128. Chiaki Sakama. Possible Model Semantics for Disjunctive Databases. In Won Kim, Jean-Marie Nicolas, and Shojiro Nishio, editors, Deductive and Object-Oriented Databases, Proceedings of the First International Conference (DOOD89), pages 1055–1060, Kyoto, Japan, 1989. North-Holland Publ.Co.

    Google Scholar 

  129. John C. Shepherdson. Negation in Logic Programming. In Jack Minker, editor, Foundations of Deductive Databases, chapter 1, pages 19–88. Morgan Kaufmann, 1988.

    Google Scholar 

  130. J. Shepherdson. Negation as failure, completion and stratification. In Handbook of AI and LP, 1990.

    Google Scholar 

  131. Chiaki Sakama and Katsumi Inoue. Negation in Disjunctive Logic Programs. In D. Warren and Peter Szeredi, editors, Proceedings of the 10th Int. Conf. on Logic Programming, Budapest, Cambridge, Mass., July 1993. MIT Press.

    Google Scholar 

  132. Chiaki Sakama and Hirohisa Seki. Partial Deduction of Disjunctive Logic Programs: A Declarative Approach. In Logic Program Synthesis and Transformation — Meta Programming in Logic, LNCS 883, pages 170–182, Berlin, 1995. Springer. Extended version to appear in Journal of Logic Programming.

    Google Scholar 

  133. H. Tamaki and T. Sato. OLD Resolution with Tabulation. In Proceedings of the Third International Conference on Logic Programming, London, LNAI, pages 84–98, Berlin, June 1986. Springer.

    Google Scholar 

  134. G. Wagner. A database needs two kinds of negation. In B. Thalheim, J. Demetrovics, and H-D. Gerhardt, editors, Mathematical Foundations of Database Systems, LNCS 495, pages 357–371, Berlin, 1991. Springer.

    Google Scholar 

  135. Bernd Wolfinger, editor. GI-Fachgespräch 2: Disjunktive logische Programmierung und disjunktive Datenbanken, pages 51–100. Springer, Berlin, 1994.

    Google Scholar 

  136. D. H. Warren, L. M. Pereira, and F. Pereira. Prolog: The language and its implementation compared with Lisp. In Symp. on AI and Programming Languages, pages 109–115. ACM SIGPLAN-SIGART, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, University of Koblenz, Rheinau 1, D-56075, Koblenz, Germany

    Jürgen Dix

  2. Dept. Computer Science and Centria, Universidade Nova de Lisboa, 2825, Monte da Caparica, Portugal

    Luís Moniz Pereira

  3. Dept. Computer Science, University of California at Riverside, 92521, Riverside, CA, USA

    Teodor Przymusinski

Authors
  1. Jürgen Dix
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Moniz Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Teodor Przymusinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dix Luís Moniz Pereira Teodor C. Przymusinski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dix, J., Pereira, L.M., Przymusinski, T. (1997). Prolegomena to logic programming for non-monotonic reasoning. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1996. Lecture Notes in Computer Science, vol 1216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023799

Download citation

  • DOI: https://doi.org/10.1007/BFb0023799

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62843-9

  • Online ISBN: 978-3-540-68702-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics