An inclusion theorem for defeasible logics

Billington, David, Antoniou, Grigoris, Governatori, Guido and Maher, Michael J. (2010) An inclusion theorem for defeasible logics. ACM Transactions on Computational Logic, 12 (1). p. 6. ISSN 1557-945X

PDF - Published Version Restricted to Repository staff only Download (193kB)

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.

Item Type:	Article
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools:	School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge School of Computing and Engineering
Related URLs:	Author
Depositing User:	Grigoris Antoniou
Date Deposited:	03 Jul 2012 12:10
Last Modified:	28 Aug 2021 20:41
URI:	https://eprints.hud.ac.uk/id/eprint/13990

Downloads

Repository Staff Only: item control page

View Item