Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On the Relationship between Defeasible Logic and Well-Founded Semantics

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

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

Abstract

We investigate in this paper the relationship between an ambiguity propagating defeasible logic recently proposed by Antoniouet al. [3] and well-founded semantics with priorities [6] under a straightforward translation from defeasible theories to extended logic programs. It turns out that a slightly restricted version of defeasible logic is correct wrt well-founded semantics yet incomplete. We also investigate the sources of the incompleteness and argue that the additional conclusions obtained by prioritized well-founded semantics are indeed desired.

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. Antoniou, G., Billington, D., Governatori, G., Maher, M. J., A Flexible Framework for Defeasible Logics, Proc. 17th American National Conference on Artificial Intelligence, AAAI-2000, 405–410 121

    Google Scholar 

  2. Antoniou, G., Billington, D., Governatori, G., Maher, M. J., Representation Results for Defeasible Logics, ACM Transactions on Computational Logic, in print 121, 122

    Google Scholar 

  3. Antoniou, G., Billington, D., Governatori, G., Maher, M. J., Rock, A., A Family of Defeasible Reasoning Logics and its Implementation, Proc. European Conference on Artificial Intelligence ECAI-2000, 459–463 121, 122, 123, 130

    Google Scholar 

  4. Baral, C., Gelfond, M., Logic Programming and Knowledge Representation,Journal of Logic Programming, 19,20:73–148, 1994 125

    Article  MathSciNet  Google Scholar 

  5. Baral, C., Subrahmanian, V. S., Duality between Alternative Semantics of Logic Programs and Nonmonotonic Formalisms, Intl. Workshop on Logic Programming and Nonmonotonic Reasoning, 1991 125

    Google Scholar 

  6. Brewka, G., Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences. Journal of Artificial Intelligence Research, 4:19–36, 1996 121, 122, 124, 125, 126, 130, 131

    MATH  MathSciNet  Google Scholar 

  7. Brewka, G., Eiter, T., Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109, 297–356, 1999 121

    Article  MATH  MathSciNet  Google Scholar 

  8. Gelfond, M., Lifschitz, V., Logic Programs with Classical Negation, Proc. 7th Intl. Conference on Logic Programming, 1990 125

    Google Scholar 

  9. van Gelder, A., Ross, K., Schlipf, J., The Well-Founded Semantics for General Logic Programs, Journal of ACM, 221–230, 1990 125

    Google Scholar 

  10. Lifschitz, V., Foundations of Declarative Logic Programming, in: G. Brewka (ed.), Principles of Knowledge Representation, Studies in Logic, Language and Information, CSLI publications, 1996 125

    Google Scholar 

  11. McCarthy, J., Circumscription-A Form of Nonmonotonic Reasoning, Artificial Intelligence 13, 1980 121

    Google Scholar 

  12. Maher, M. J., Rock, A., Antoniou, G., Billington, D., Miller, T., Efficient Defeasible Reasoning Systems, Proc. 12th IEEE International Conference on Tools with Artificial Intelligence, ICTAI-2000, 384–392 121, 131

    Google Scholar 

  13. Nute, D., Defeasible Reasoning, in Proc. 20th Hawaii International Conference on on Systems Science, IEEE Press, 1987, 470–477 121, 122

    Google Scholar 

  14. Nute, D., Defeasible Logic, in D. M. Gabbay, C. J. Hogger, J. A. Robinson (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Oxford University Press, 1994, 353–395 121

    Google Scholar 

  15. Przymusinski, T., The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics, Fundamenta Informaticae, 1989 125

    Google Scholar 

  16. Przymusinski, T., Stable Semantics for Disjunctive Programs, New Generation Computing, 9:401–424, 1991 125

    Article  Google Scholar 

  17. Reiter, R., A Logic for Default Reasoning, Artificial Intelligence 13 (1980) 81–132 121

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. of Computer Science Augustusplatz 10-11, University of Leipzig, 04109, Leipzig, Germany

    Gerhard Brewka

Authors
  1. Gerhard Brewka
    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

Brewka, G. (2001). On the Relationship between Defeasible Logic and Well-Founded Semantics. 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_9

Download citation

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

  • 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