Proving quantified literals in defeasible logic

  • David Billington
Knowledge Representation and Reasoning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1342)


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.


Quantified literals Defeasible logic Nonmonotonic reasoning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. G. Antoniou [1997] “Nonmonotonic Reasoning”, MIT Press, Cambridge, Massachusetts, USA.Google Scholar
  2. 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
  3. D. Billington [1993] “Defeasible Logic is Stable”, Journal of Logic and Computation 3,379–400.Google Scholar
  4. D. Billington [1994] “Adding Disjunction to Defeasible Logic”, Proceedings of the 7th Australian Joint Conference on Artificial Intelligence, World Scientific, 259–266.Google Scholar
  5. D. Billington [1996] “A Defeasible Logic with Quantifiers”, Griffith University, School of Computing and Information Technology, research report.Google Scholar
  6. G. Brewka [1991] “Nonmonotonic Reasoning: Logical Foundations of Commonsense”, Cambridge University Press.Google Scholar
  7. 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
  8. W. Lukaszewicz [1990] “Non-monotonic Reasoning Formalization of Commonsense Reasoning”, Ellis Horwood.Google Scholar
  9. D. Nute [1988a] “Defeasible Reasoning: A Philosophical Analysis in Prolog”, in J.H. Fetzer (ed.) “Aspects of Artificial Intelligence”, Kluwer, 251–288.Google Scholar
  10. D. Nute [1988b] “Defeasible Reasoning and Decision Support Systems”, Decision Support Systems 4, 97–110.CrossRefGoogle Scholar
  11. D. Nute, R.I.Mann, and B.F.Brewer [1990] “Controlling Expert System Recommendations with Defeasible Logic”, Decision Support Systems 6, 153–164.CrossRefGoogle Scholar
  12. 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
  13. 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
  14. 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
  15. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • David Billington
    • 1
  1. 1.School of Computing and Information TechnologyGriffith UniversityBrisbaneAustralia

Personalised recommendations