An inclusion theorem for defeasible logics

David Billington, Grigoris Antoniou, Guido Governatori, Michael Maher

Research output: Contribution to journalArticle

23 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

Inclusion
Logic
Theorem
Nonmonotonic Reasoning
Rejection
Reasoning
Propagation
Ambiguity
Form
Presentation
Family

Cite this

Billington, David ; Antoniou, Grigoris ; Governatori, Guido ; Maher, Michael. / An inclusion theorem for defeasible logics. In: ACM Transactions on Computational Logic. 2010 ; Vol. 12, No. 1.
@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 = "10",
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",

}

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 journalArticle

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

JF - ACM Transactions on Computational Logic

SN - 1529-3785

IS - 1

M1 - 6

ER -