Skip to main content
SpringerLink
Log in

A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs

  • Conference paper
  • First Online:
Logic Programming and Nonmotonic Reasoning (LPNMR 2001)

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

  • 284 Accesses

Abstract

Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reached about which semantics is the most intended. In this paper we look at disjunctive well-founded reasoning from different angles. We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be equivalently characterized by several different approaches including program transformations, argumentation, unfounded sets (and resolution-like procedure). We also provide a bottomup procedure for this semantics. The significance of this work is not only in clarifying the relationship among different approaches, but also in providing novel arguments in favor of our semantics.

On leave from Tsinghua University, Beijing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Brass, J. Dix. Characterizations of the DisjunctiveWell-founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, 20(1):143–165, 1998. 133

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Brass, J. Dix. Semantics of disjunctive logic programs based on partial evaluation. Journal of Logic programming, 38(3):167–312, 1999. 133, 135, 138, 139, 140, 141, 143, 145

    Google Scholar 

  3. S. Brass, J. Dix, I. Niemelä, T. Przymusinski. On the equivalence of the Static and Disjunctive Well-founded Semantics and its computation. Theoretical Computer Science, 258(1-2): 523–553, 2001. 134, 140

    Article  MATH  MathSciNet  Google Scholar 

  4. F. Bry. Negation in logic programming: A formalization in constructive logic. In: D. Karagiannis ed. Information Systems and Artificial Intelligence: Integration Aspects (LNCS 474), Springer, pages 30–46, 1990. 141

    Google Scholar 

  5. T. Eiter, N. Leone and D. Sacca. On the partial semantics for disjunctive deductive databases. Annals of Math. and AI., 19(1-2): 59–96, 1997. 134, 143, 144, 145

    MATH  MathSciNet  Google Scholar 

  6. M. Gelfond, V. Lifschitz. The stable model semantics for logic programming. In: Proceedings of the 5th Symposium on Logic Programming, MIT Press, pages 1070–1080, 1988. 133, 136

    Google Scholar 

  7. N. Leone, P. Rullo and F. Scarcello. Disjunctive stable models: unfounded sets, fixpoint semantics, and computation. Information and Computation, 135(2): 69–112, 1997. 134, 143, 144, 145

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Lobo, J. Minker and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992. 133, 134

    Google Scholar 

  9. J. Minker. On indefinite databases and the closed world assumption. LNCS 138, pages 292–308, 1982. 134, 138, 145

    Google Scholar 

  10. T. Przymusinski. Static semantics of logic programs. Annals of Math. and AI., 14: 323–357, 1995. 133

    MATH  MathSciNet  Google Scholar 

  11. K. Ross. A procedural semantics for well-founded negation in logic programs. Journal of Logic programming, 13(1): 1–22, 1992. 134

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Van Gelder, K. A. Ross and J. Schlipf. The well-founded semantics for general logic programs. J. ACM, 38(3): 620–650, 1991. 133, 134, 143

    Article  MATH  Google Scholar 

  13. K. Wang. Argumentation-based abduction in disjunctive logic programming. Journal of Logic programming, 45(1-3): 105–141, 2000. 133, 134, 136, 140, 145

    Article  MATH  MathSciNet  Google Scholar 

  14. K. Wang. A top-down procedure for disjunctive well-founded semantics. In: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR’ 01), Springer, 2001. 134, 145

    Google Scholar 

  15. J. You, L. Yuan and R. Goebel. An abductive approach to disjunctive logic programming. Journal of Logic programming, 44(1-3): 101–127, 2000. 136

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Potsdam Postfach 60 15 53, D—14415, Potsdam, Germany

    Kewen Wang

Authors
  1. Kewen Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Thomas Eiter

  2. Institut für Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Wolfgang Faber

  3. Department of Computer Science Lexington, University of Kentucky, KY, 40506-0046, USA

    Miros law Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, K. (2001). A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45402-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45402-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation