Skip to main content


An inclusion theorem for defeasible logic


David Billington, Grigoris Antoniou, Guido Governatori and Michael Maher

Griffith University





Defeasible reasoning is a computationally simple nonmonotonic reasoning approach that has attracted significant theoretical and practical attention. It comprises a family of logics that capture different intuitions, among them ambiguity propagation versus ambiguity blocking, and the adoption or rejection of team defeat. This paper provides a compact presentation of the defeasible logic variants, and derives an Inclusion Theorem which shows that different notions of provability in defeasible logic form a chain of levels of proof, while they al exhibit a basic coherence property.

BibTeX Entry

    doi              = {10.1145/1838552.1838558},
    author           = {Billington, David and Antoniou, Grigoris and Governatori, Guido and Maher, Michael},
    number           = {1},
    month            = mar,
    volume           = {12},
    year             = {2010},
    title            = {An Inclusion Theorem for Defeasible Logic},
    pages            = {N/A}


Served by Apache on Linux on seL4.