Skip to main content
SpringerLink
Log in

A study of provability in defeasible logic

  • Scientific Track
  • Conference paper
  • First Online:
Advanced Topics in Artificial Intelligence (AI 1998)

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

Included in the following conference series:

Abstract

Defeasible logic is a logic-programming based nonmonotonic reasoning formalism which has an efficient implementation. It makes use of facts, strict rules, defeasible rules, defeaters, and a superiority relation. We clarify the proof theory of defeasible logic through an analysis of the conclusions it can draw. Using it, we show that defeaters do not add to the expressiveness of defeasible logic, among other results. The analysis also supports the restriction of defeasible logic to admit only acyclic superiority relations.

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. G. Antoniou. Nonmonotonic Reasoning. MIT Press 1997.

    Google Scholar 

  2. G. Antoniou, D. Billington and M.J. Maher. Normal Forms for Defeasible Logic. In Proc. Joint International Conference and Symposium on Logic Programming 1998, MIT Press 1998 (accepted).

    Google Scholar 

  3. D. Billington. Defeasible Logic is Stable. Journal of Logic and Computation 3 (1993): 370–400.

    MathSciNet  Google Scholar 

  4. M.A. Covington, D. Nute and A. Vellino. Prolog Programming in Depth. Prentice Hall 1997.

    Google Scholar 

  5. B.N. Grosof. Prioritized Conflict Handling for Logic Programs. In: Proc. Int. Logic Programming Symposium, J. Maluszynski (Ed.), 197–211. MIT Press, 1997.

    Google Scholar 

  6. V. Marek and M. Truszczynski. Nonmonotonic Logic, Springer 1993.

    Google Scholar 

  7. D. Nute. Defeasible Reasoning. In Proc. 20th Hawaii International Conference on Systems Science, IEEE press 1987, 470–477.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIT, Griffith University, 4111, Nathan, QLD, Australia

    M. J. Maher, G. Antoniou & D. Billington

Authors
  1. M. J. Maher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Antoniou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Billington
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grigoris Antoniou John Slaney

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maher, M.J., Antoniou, G., Billington, D. (1998). A study of provability in defeasible logic. In: Antoniou, G., Slaney, J. (eds) Advanced Topics in Artificial Intelligence. AI 1998. Lecture Notes in Computer Science, vol 1502. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095054

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation