An inclusion theorem for defeasible logics

David Billington; Grigoris Antoniou; Guido Governatori; Michael Maher

doi:10.1145/1838552.1838558

An inclusion theorem for defeasible logics

David Billington, Grigoris Antoniou, Guido Governatori, Michael Maher

Research output: Contribution to journal › Article

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 language	English
Article number	6
Journal	ACM Transactions on Computational Logic
Volume	12
Issue number	1
DOIs	https://doi.org/10.1145/1838552.1838558
Publication status	Published - 1 Oct 2010
Externally published	Yes

Access to Document

10.1145/1838552.1838558Licence: Unspecified

Link to publication in Scopus

Fingerprint Dive into the research topics of 'An inclusion theorem for defeasible logics'. Together they form a unique fingerprint.

Cite this

Billington, D., Antoniou, G., Governatori, G., & Maher, M. (2010). An inclusion theorem for defeasible logics. ACM Transactions on Computational Logic, 12(1), [6]. https://doi.org/10.1145/1838552.1838558

@article{1c4a535ab56a4b2f920dfd4866425152,

title = "An inclusion theorem for defeasible logics",

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.",

keywords = "Ambiguity blocking, Ambiguity propagation, Defeasible logic, Defeasible logic variants, Team defeat",

author = "David Billington and Grigoris Antoniou and Guido Governatori and Michael Maher",

year = "2010",

month = oct,

day = "1",

doi = "10.1145/1838552.1838558",

language = "English",

volume = "12",

journal = "ACM Transactions on Computational Logic",

issn = "1529-3785",

publisher = "Association for Computing Machinery (ACM)",

number = "1",

}

TY - JOUR

T1 - An inclusion theorem for defeasible logics

AU - Billington, David

AU - Antoniou, Grigoris

AU - Governatori, Guido

AU - Maher, Michael

PY - 2010/10/1

Y1 - 2010/10/1

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

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

KW - Ambiguity blocking

KW - Ambiguity propagation

KW - Defeasible logic

KW - Defeasible logic variants

KW - Team defeat

UR - http://www.scopus.com/inward/record.url?scp=78449234487&partnerID=8YFLogxK

U2 - 10.1145/1838552.1838558

DO - 10.1145/1838552.1838558

M3 - Article

AN - SCOPUS:78449234487

VL - 12

JO - ACM Transactions on Computational Logic

JF - ACM Transactions on Computational Logic

SN - 1529-3785

IS - 1

M1 - 6

ER -