An inclusion theorem for defeasible logics
No Thumbnail Available
File version
Author(s)
Billington, David
Antoniou, Grigoris
Governatori, Guido
Maher, Michael
Antoniou, Grigoris
Governatori, Guido
Maher, Michael
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2010
Size
File type(s)
Location
License
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.
Journal Title
ACM Transactions on Computational Logic
Conference Title
Book Title
Edition
Volume
12
Issue
1
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Pure mathematics
Theory of computation
Theory of computation not elsewhere classified