An inclusion theorem for defeasible logics

David Billington, Grigoris Antoniou, Guido Governatori, Michael Maher

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

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 article 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.

Original languageEnglish
Article number6
JournalACM Transactions on Computational Logic
Volume12
Issue number1
DOIs
Publication statusPublished - 1 Oct 2010
Externally publishedYes

    Fingerprint

Cite this