Skip to main content
SpringerLink
Log in

A general approach to bottom-up computation of disjunctive semantics

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

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

Abstract

Our goal is to derive bottom-up query-evaluation algorithms from abstract properties of the underlying negation semantics. In this paper, we demonstrate our approach for the disjunctive stable model semantics, but the ideas are applicable to many other semantics as well. Our framework also helps to understand and compare other proposed query evaluation algorithms. It is based on the notion of conditional facts, developed by Bry and Dung/Kanchansut. We start by computing a “residual program” and show that it is equivalent to the original program under very general conditions on the semantics (which are satisfied, e.g., by the well-founded, stable, stationary, and static semantics). Many queries can already be answered on the basis of the residual program. For the remaining literals, we propose to use an appropriate completion of the residual program, which syntactically characterizes the intended models. In the case of the stable model semantics, we utilize an interesting connection to Clark's completion.

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. Krzysztof R. Apt and Roland N. Bol. Logic programming and negation: A survey. The Journal of Logic Programming, 19/20:9–71, 1994.

    Article  Google Scholar 

  2. Stefan Brass and Jürgen Dix. Caracterizations of the Stable Semantics by Partial Evaluation. In A. Nerode, W. Marek, and M. Truszczyński, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Third International Conference. Springer LNCS, to appear, June 1995.

    Google Scholar 

  3. Stefan Brass and Jürgen Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In Leon Sterling, editor, Proceedings of the 12th Int. Conf. on Logic Programming, Tokyo. MIT, June 1995.

    Google Scholar 

  4. Nicole Bidoit and Richard Hull. Positivism vs. minimalism in deductive databases. In Proc. of the 5th ACM Symp. on Principles of Database Systems (PODS'86), pages 123–132, 1986.

    Google Scholar 

  5. Stefan Brass and Udo W. Lipeck. Generalized bottom-up query evaluation. In Alain Pirotte, Claude Delobel, and Georg Gottlob, editors, Advances in Database Technology — EDBT'92, 3rd Int. Conf., number 580 in LNCS, pages 88–103. Springer-Verlag, 1992.

    Google Scholar 

  6. Stefan Brass and Udo W. Lipeck. Bottom-up query evaluation with partially ordered defaults. In Proceedings of the 3rd International Conference on Deductive and Object-Oriented Databases (DOOD'93), pages 253–266, LNCS 769. Springer, 1993.

    Google Scholar 

  7. Colin Bell, Anil Nerode, Raymond Ng, and V. S. Subrahmanian. Implementing stable semantics by linear programming. In Luís Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-monotonic Reasoning, Proc. of the Second Int. Workshop (LPNMR'93), pages 23–42. MIT Press, 1993.

    Google Scholar 

  8. Stefan Brass. Beginnings of a theory of general database completions. In Serge Abiteboul and Paris C. Kanellakis, editors, Third International Conference on Database Theory (ICDT'90), number 470 in LNCS, pages 349–363. Springer-Verlag, 1990.

    Google Scholar 

  9. Stefan Brass. Bottom-up query evaluation in disjunctive deductive databases. Research report, Institut für Informatik, Universität Hannover, 1995.

    Google Scholar 

  10. 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 

  11. François Bry. Negation in logic programming: A formalization in constructive logic. In Dimitris Karagiannis, editor, Information Systems and Artificial Intelligence: Integration Aspects, pages 30–46. Springer, 1990.

    Google Scholar 

  12. Chin-Liang Chang and Richard C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.

    Google Scholar 

  13. Stefania Costantini and Gaetano Lanzarone. Static Semantics as Program Transformation and Well-founded Computation, this Volume, pages 156–180, 1995.

    Google Scholar 

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

    Google Scholar 

  15. Weidong Chen and David S. Warren. Computation of stable models and its integration with logical query processing. Technical report, SUNY at Stony Brook, 1993.

    Google Scholar 

  16. Robert Demolombe. An efficient strategy for nonhorn deductive databases. Theoretical Computer Science, 78:245–259, 1991.

    Article  Google Scholar 

  17. Jürgen 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: Proc. of the Third Int. Conf. (KR'92), pages 591–602. Morgan Kaufmann, 1992.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  20. 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. Proceedings of the Konstanz Colloquium in Logic and Information (LogIn '92), pages 227–313. DeGruyter, 1995.

    Google Scholar 

  21. Phan Minh Dung and Kanchana Kanchansut. A fixpoint approach to declarative semantics of logic programs. In Proc. NACLP'89, pages 604–625, 1989.

    Google Scholar 

  22. Phan Minh Dung and Kanchana Kanchansut. A natural semantics of logic programs with negation. In Proc. of the Ninth Conf. on Foundations of Software Technology and Theoretical Computer Science, pages 70–80, 1989.

    Google Scholar 

  23. 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. Lisbon, MIT Press, July 1993.

    Google Scholar 

  24. Jürgen Dix and Martin Müller. An Axiomatic Framework for Representing and Characterizing Semantics of Disjunctive Logic Programs. In Pascal Van Hentenryck, editor, Proceedings of the 11th Int. Conf. on Logic Programming, S. Margherita Ligure, pages 303–322. MIT, June 1994.

    Google Scholar 

  25. Jürgen Dix and Martin Müller. Partial Evaluation and Relevance for Approximations of the Stable Semantics. In Z.W. Ras and M. Zemankova, editors, Proceedings of the 8th Int. Symp. on Methodologies for Intelligent Systems, Charlotte, NC, 1994, pages 511–520. Springer, Lecture Notes in Artificial Intelligence 869, 1994.

    Google Scholar 

  26. Jürgen Dix and Martin Müller. The Stable Semantics and its Variants: A Comparison of Recent Approaches. In L. Dreschler-Fischer and B. Nebel, editors, Proceedings of the 18th German Annual Conference on Artificial Intelligence (KI '94), Saarbrücken, Germany, pages 82–93. Springer, Lecture Notes in Artificial Intelligence 861, 1994.

    Google Scholar 

  27. Lars Degerstedt and Ulf Nilsson. Magic Computation of Well-founded Semantics. This volume, pages 127–155, 1995.

    Google Scholar 

  28. 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 

  29. Yong Hu and Li Yan Yuan. Extended well-founded model semantics for general logic programs. In Koichi Furukawa, editor, Proc. of the 8th Int. Conf. on Logic Programming (ICLP'91), pages 412–425. MIT Press, 1991.

    Google Scholar 

  30. Sarit Kraus, Daniel Lehmann, and Menachem Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44:167–207, 1990.

    Article  Google Scholar 

  31. David B. Kemp, Peter J. Stuckey, and Divesh Srivastava. Magic sets and bottom-up evaluation of well-founded models. In Proc. of the 1991 Int. Symposium on Logic Programming, pages 337–351. MIT Press, 1991.

    Google Scholar 

  32. Jack Minker. On indefinite databases and the closed world assumption. In Proceedings of the 6th Conference on Automated Deduction, New York, pages 292–308. Springer, 1982.

    Google Scholar 

  33. Jack Minker and Arcot Rajasekar. A fixpoint semantics for disjunctive logic programs. The Journal of Logic Programming, 9:45–74, 1990.

    Article  Google Scholar 

  34. Luís Moniz Pereira, Joaquim N. Aparício, and José J. Alferes. Derivation procedures for extended stable models. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pages 863–868, 1991.

    Google Scholar 

  35. 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.).

    Google Scholar 

  36. Teodor C. Przymusinski. Semantics of disjunctive logic programs and deductive databases. In Claude Delobel, Michael Kifer, and Yoshifumi Masunaga, editors, Deductive and Object-Oriented Databases, 2nd Int. Conf. (DOOD'91), number 566 in LNCS, pages 85–107. Springer-Verlag, 1991.

    Google Scholar 

  37. Teodor Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 1995. To appear.

    Google Scholar 

  38. Arcot Rajasekar, Jorge Lobo, and Jack Minker. Weak Generalized Closed World Assumption. Journal of Automated Reasoning, 5:293–307, 1989.

    Article  Google Scholar 

  39. Kenneth A. Ross. The well founded semantics for disjunctive logic programs. In Won Kim, Jean-Marie Nicolas, and Shojiro Nishio, editors, Deductive and Object-Oriented Databases, Proc. of the First International Conference (DOOD'89), pages 385–402. North-Holland, 1990.

    Google Scholar 

  40. Véronique Royer. Backward chaining evaluation in stratified disjunctive theories. In Proc. of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'90), pages 183–195, 1990.

    Google Scholar 

  41. Raghu Ramakrishnan, Divesh Srivastava, and S. Sudarshan. Rule ordering in bottom-up fixpoint evaluation of logic programs. IEEE Transactions on Knowledge and Data Engineering, 6(4):501–517, 1994.

    Article  Google Scholar 

  42. Kenneth A. Ross and Rodney W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4:397–424, 1988.

    Article  Google Scholar 

  43. Dietmar Seipel. An efficient computation of the extended generalized closed world assumption by support-for-negation sets. In Proc. Int. Conf. on Logic Programming and Automated Reasoning (LPAR'94), number 822 in LNAI, pages 245–259. Springer, 1994.

    Google Scholar 

  44. Chiaki Sakama and Hirohisa Seki. Partial Deduction of Disjunctive Logic Programs: A Declarative Approach. In Fourth International Workshop on Logic Program Synthesis and Transformation (LOPSTR'94). Lecture Notes in Computer Science, Springer-Verlag, July 1994.

    Google Scholar 

  45. Allen Van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of the Association for Computing Machinary (JACM), 38:620–650, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. f. Informatik, Univ. of Hannover, Lange Laube 22, D-30159, Hannover, FRG

    Stefan Brass

  2. Inst. f. Informatik, Univ. of Koblenz, Rheinau 1, D-56075, Koblenz, FRG

    Jürgen Dix

Authors
  1. Stefan Brass
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Dix
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dix Louis Moniz Pereira Teodor C. Przymusinski

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brass, S., Dix, J. (1995). A general approach to bottom-up computation of disjunctive semantics. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1994. Lecture Notes in Computer Science, vol 927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030663

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59467-3

  • Online ISBN: 978-3-540-49272-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation