Skip to main content
SpringerLink
Log in

Generalized disjunctive well-founded semantics for logic programs

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Generalized disjunctive well-founded semantics (GDWFS) is a refined form of the generalized well-founded semantics (GWFS) of Baral, Lobo and Minker, to disjunctive logic programs. We describe fixpoint, model theoretic and procedural characterizations of GDWFS and show their equivalence. The fixpoint semantics is similar to the fixpoint semantics of the GWFS, except that it iterates over state-pairs (a pair of sets; one a set of disjunctions of atoms and the other a pair of conjunctions of atoms), rather than partial interpretations. The model theoretic semantics is based on a dynamic stratification of the program. The procedural semantics is based on SLIS refutations, + trees and SLISNF trees.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Baral, J. Lobo and J. Minker, Generalized well-founded semantics for logic programs: in:Proc. 10th Int. Conf. on Automated Deduction, ed. M.E. Stickel, Kaiserslautern, Germany (Springer, 1990) pp. 102–116.

  2. C. Baral and V.S. Subrahmanian, Stable and extension class theory for logic programs and default logics, Technical Report CS-TR-2402, Dept of Computer Science, University of Maryland (February 1990), presented at the3rd Int. Workshop on Non-Monotonic Reasoning, South Lake Tahoe (May 90), extended version to appear in J. Auto. Reasoning.

  3. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming: inProc. Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen, Seattle, Washington (1988) pp. 1070–1080.

  4. R.A. Kowalski and D. Kuehner, Linear resolution with selection function, Art. Int. 2 (1971) 227–260.

    Google Scholar 

  5. J.W. Lloyd,Foundations of Logic Programming (Springer, 1984).

  6. J. Lobo, Minker and A. Rajasekar, Circumscription and disjunctive logic programming, in:Artificial Intelligence and Mathematical Theory of Computation, ed. V. Lifschitz (Academic Press, 1991).

  7. J. Lobo, A. Rajasekar and J. Minker, Weak completion theory for non-Horn programs, in:Proc. 5th Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen, Seattle, Washington (1988) pp. 828–842.

  8. J. Minker, On indefinite databases and the Closed World Assumption, in:Lecture Notes in Computer Science 138 (Springer, 1982) pp. 292–308.

  9. J. Minker and A. Rajasekar, Procedural interpretation of non-Horn logic programs, in:Proc. 9th Int. Conf. on Automated Deduction, eds. E. Lusk and R. Overbeek, Argonne, IL (1988) pp. 278–293.

  10. J. Minker and A. Rajasekar, A fixpoint semantics for disjunctive logic programs, J. Logic Progr. 9 (1990) 45–74.

    Google Scholar 

  11. J. Minker, A. Rajasekar and J. Lobo, Theory of disjunctive logic programs, in:Computational Logic: Essays in Honor of Alan Robinson, ed. J. Lassez (MIT Press, 1990).

  12. J. Minker and G. Zanon, An extension to linear resolution with selection function, Inform. Proc. Lett. 14 (1982) 191–194.

    Google Scholar 

  13. H. Przymusinska and T. Przymusinski, Weakly perfect model semantics for logic programs, in:Proc. 5th Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen, Seattle, Washington (1988) pp. 1106–1120.

  14. T. Przymusinski, Stationary semantics for disjunctive logic programs and deductive databases, in:Proc. North American Conf. on Logic Programming, eds. S. Debray and M. Hermenegildo (MIT Press, 1990) pp. 42–59.

  15. T. Przymusinski, On the relationship between logic programming and non-monotonic reasoning, in:Proc. AAAI-88 (1988) pp. 444–440.

  16. T.C. Przymusinski, Non-monotonic reasoning vs. logic programming — A new perspective, in:Handbook on the Formal Foundations of AI, eds. Y. Wilks and D. Partridge (1988).

  17. T.C. Przymusinski, On the declarative semantics of deductive databases and logic programming, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Washington, DC, 1988) pp. 193–216.

    Google Scholar 

  18. T. Przymusinski, Three-valued formalizations of non-monotonic reasoning and logic programming, in:Proc. 1st Int. Conf. on Knowledge Representation and Reasoning (1989) pp. 341–348.

  19. T.C. Przymusinski, Every logic program has a natural stratification and an iterated fixed point model, in:Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (1989) pp. 11–21.

  20. A. Rajasekar and J. Minker, On stratified disjunctive programs, Ann. Math. Art. Int. 1 (1990) 339–357.

    Google Scholar 

  21. K. Ross, Well-founded semantics for disjunctive logic programs, in:Proc. 1st Int. Conf. on Deductive and Object Oriented Databases, Kyoto, Japan (1989).

  22. J.C. Shepherdson, Negation in logic programming, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, 1988) pp. 19–88.

  23. A. Van Gelder, K. Ross and J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in:Proc. 7th Symp. on Principles of Database Systems (1988) pp. 221–230, to appear in J. ACM.

  24. A. Yahya and L.J. Henschen, Deduction in non-Horn databases, J. Autom. Reasoning 1 (1985) 141–160.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, 20742, College Park, MD, USA

    Chitta Baral & Jack Minker

  2. Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA

    Jorge Lobo & Jack Minker

Authors
  1. Chitta Baral
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorge Lobo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jack Minker
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baral, C., Lobo, J. & Minker, J. Generalized disjunctive well-founded semantics for logic programs. Ann Math Artif Intell 5, 89–131 (1992). https://doi.org/10.1007/BF01543473

Download citation

  • Issue Date:

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

Keywords

Search

Navigation