Scientific Track

Advanced Topics in Artificial Intelligence

Volume 1502 of the series Lecture Notes in Computer Science pp 215-226


A study of provability in defeasible logic

  • M. J. MaherAffiliated withCIT, Griffith University
  • , G. AntoniouAffiliated withCIT, Griffith University
  • , D. BillingtonAffiliated withCIT, Griffith University

* Final gross prices may vary according to local VAT.

Get Access


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.