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.
| Language | English |
|---|---|
| Article number | 6 |
| Journal | ACM Transactions on Computational Logic |
| Volume | 12 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Oct 2010 |
| Externally published | Yes |
Fingerprint
Cite this
}
An inclusion theorem for defeasible logics. / Billington, David; Antoniou, Grigoris; Governatori, Guido; Maher, Michael.
In: ACM Transactions on Computational Logic, Vol. 12, No. 1, 6, 01.10.2010.Research output: Contribution to journal › Article
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
VL - 12
JO - ACM Transactions on Computational Logic
T2 - ACM Transactions on Computational Logic
JF - ACM Transactions on Computational Logic
SN - 1529-3785
IS - 1
M1 - 6
ER -