A study of provability in defeasible logic

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationAdvanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers
EditorsGrigoris Antoniou, John Slaney
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540651381, 9783540651383
Publication statusPublished - 13 Nov 1998
Externally publishedYes
Event11th Australian Joint Conference on Artificial Intelligence - Brisbane, Australia
Duration: 13 Jul 199817 Jul 1998
Conference number: 11

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th Australian Joint Conference on Artificial Intelligence
Abbreviated titleAI 98


Dive into the research topics of 'A study of provability in defeasible logic'. Together they form a unique fingerprint.

Cite this