Skip to main content
SpringerLink
Log in
Book cover

Australian Joint Conference on Artificial Intelligence

AI 1997: Advanced Topics in Artificial Intelligence pp 265–273Cite as

Proving quantified literals in defeasible logic

  • Knowledge Representation and Reasoning
  • Conference paper
  • First Online:

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

Abstract

Defeasible Logic is a nonmonotonic reasoning approach which has an efficient implementation. Currently Defeasible Logic can only prove ground literals. We describe a version of Defeasible Logic which is capable of proving existentially and universally closed literals, as well as ground literals. The intuition motivating the formalism is presented, as are some of its properties.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • G. Antoniou [1997] “Nonmonotonic Reasoning”, MIT Press, Cambridge, Massachusetts, USA.

    Google Scholar 

  • D. Billington, K. De Coster, and D. Nute [1990] ”A Modular Translation from Defeasible Nets to Defeasible Logics”,Journal of Experimental and Theoretical Artificial Intelligence, 2, 151–177.

    Google Scholar 

  • D. Billington [1993] “Defeasible Logic is Stable”, Journal of Logic and Computation 3,379–400.

    Google Scholar 

  • D. Billington [1994] “Adding Disjunction to Defeasible Logic”, Proceedings of the 7th Australian Joint Conference on Artificial Intelligence, World Scientific, 259–266.

    Google Scholar 

  • D. Billington [1996] “A Defeasible Logic with Quantifiers”, Griffith University, School of Computing and Information Technology, research report.

    Google Scholar 

  • G. Brewka [1991] “Nonmonotonic Reasoning: Logical Foundations of Commonsense”, Cambridge University Press.

    Google Scholar 

  • R. Fordyce and D. Billington [1992] “DLog(e): An Implementation of Defeasible Logic”, Proceedings of the 5th Australian Joint Conference on Artificial Intelligence, 284–289.

    Google Scholar 

  • W. Lukaszewicz [1990] “Non-monotonic Reasoning Formalization of Commonsense Reasoning”, Ellis Horwood.

    Google Scholar 

  • D. Nute [1988a] “Defeasible Reasoning: A Philosophical Analysis in Prolog”, in J.H. Fetzer (ed.) “Aspects of Artificial Intelligence”, Kluwer, 251–288.

    Google Scholar 

  • D. Nute [1988b] “Defeasible Reasoning and Decision Support Systems”, Decision Support Systems 4, 97–110.

    Article  Google Scholar 

  • D. Nute, R.I.Mann, and B.F.Brewer [1990] “Controlling Expert System Recommendations with Defeasible Logic”, Decision Support Systems 6, 153–164.

    Article  Google Scholar 

  • D. Nute [1992] “Basic Defeasible Logic”, in L.F.D. Cerro and M. Penttonen (eds.) “Intensional Logics for Programming”, Clarendon Press, Oxford, 125–154.

    Google Scholar 

  • D. Nute [1994a] “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. Clarendon Press, Oxford, 353–395.

    Google Scholar 

  • D. Nute [1994b] “ADecidable Quantified Defeasible Logic”, in D.Prawitz, B.Skyrms, and D.Westerståhl (eds.) Logic, Methodology and Philosophy of Science IX. Elsevier Science B.V, 263–284.

    Google Scholar 

  • D. Nute and M. Lewis [1986] “A users' Manual for d-Prolog” Technical Report 01-0016, The Artificial Intelligence Center, Rm 111 GSRC, The University of Georgia, Athens, GA, 30602-7415, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Information Technology, Griffith University, Nathan, 4111, Brisbane, Queensland, Australia

    David Billington

Authors
  1. David Billington
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Abdul Sattar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Billington, D. (1997). Proving quantified literals in defeasible logic. In: Sattar, A. (eds) Advanced Topics in Artificial Intelligence. AI 1997. Lecture Notes in Computer Science, vol 1342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63797-4_79

Download citation

  • DOI: https://doi.org/10.1007/3-540-63797-4_79

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63797-4

  • Online ISBN: 978-3-540-69649-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation