Skip to main content
SpringerLink
Log in

A Top-Down Procedure for Disjunctive Well-Founded Semantics

  • Conference paper
  • First Online:
Automated Reasoning (IJCAR 2001)

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

Included in the following conference series:

Abstract

Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming is usually named well-founded semantics. However, the issue of defining and computing the well-founded semantics for disjunctive programs and databases has proved to be far more complex and difficult than for normal logic programs. The argumentation-based semantics WFDS is among the most promising proposals that attempts to define a natural well-founded semantics for disjunctive programs. In this paper, we propose a top-down procedure for WFDS called D-SLS Resolution, which naturally extends the Global SLS-resolution and SLI-resolution. We prove that D-SLS Resolution is sound and complete with respect to WFDS. This result in turn provides a further yet more powerful argument in favor of the WFDS.

On leave from Tsinghua University, Beijing.

Acknowledgments

The author would like to thank Peter Baumgartner, Ph. Besnard, J. Dix, Th. Linke and T. Schaub for useful comments and discussions on (the topic of) this work. The author would also like to thank the four anonymous referees for their detailed comments. This work was supported in part by the German Science Foundation (DFG) within Project “Nichtmonotone Inferenzsysteme zur Verarbeitung konfligierender Regeln” under grant FOR 375/1-1, TP C, the Natural Science Foundation of China under the projects 69883008, the National Foundation Research Programme of China under G1999032704.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

    Article  MathSciNet  MATH  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.

    MathSciNet  MATH  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, 251 (to appear), 2001.

    Google Scholar 

  4. W. Chen, D. Warren. Efficient top-down computation of queries under the well-founded semantics. J. ACM, 43(1): 20–74, 1996.

    Article  MathSciNet  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.

    MathSciNet  MATH  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.

    Google Scholar 

  7. N. Leone, P. Rullo and F. Scarcello. Disjunctive stable models: unfounded sets, fixpoint semantics, and computation. Information and Computation, 135(2), 1997.

    Google Scholar 

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

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  12. K. Wang. Argumentation-based abduction in disjunctive logic programming. Journal of Logic programming, 45(1-3):105–141, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  13. K. Wang. Disjunctive well-founded semantics revisited. In: Proceedings of the 5th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR’01), Potsdam, April 4-6, pages 193–203, 2001.

    Google Scholar 

  14. K. Wang, F. Lin. Closed world reasoning and query evaluation in disjunctive deductive databases. In: Proceedings of the International Conference on Applications of Prolog /DDLP’99, 1999.

    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.

    Article  MathSciNet  MATH  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. Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia

    Rajeev Goré

  2. AG Theoretische Informatik und Logik, Institut für Computersprachen, Technische Universität Wien, Favoritenstr. 9, E185-2, 1040, Wien, Austria

    Alexander Leitsch

  3. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, K. (2001). A Top-Down Procedure for Disjunctive Well-Founded Semantics. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45744-5_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45744-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation