dc.contributor.author | Antoniou, Grigoris | |
dc.contributor.author | Billington, David | |
dc.contributor.author | Governatori, Guido | |
dc.contributor.author | Maher, Michael J | |
dc.date.accessioned | 2017-05-03T11:27:46Z | |
dc.date.available | 2017-05-03T11:27:46Z | |
dc.date.issued | 2006 | |
dc.date.modified | 2008-07-20T22:59:03Z | |
dc.identifier.issn | 1471-0684 | |
dc.identifier.doi | 10.1017/S1471068406002778 | |
dc.identifier.uri | http://hdl.handle.net/10072/14392 | |
dc.description.abstract | Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory $D$ into a meta-program $P(D)$. We show that under a condition of decisiveness, the defeasible consequences of $D$ correspond exactly to the sceptical conclusions of $P(D)$ under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of $D$ are included in all stable models of $P(D)$). If we wish a complete embedding for the general case, we need to use the Kunen semantics of $P(D)$, instead. | |
dc.description.peerreviewed | Yes | |
dc.description.publicationstatus | Yes | |
dc.format.extent | 266672 bytes | |
dc.format.mimetype | application/pdf | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Cambridge University Press | |
dc.publisher.place | UK | |
dc.relation.ispartofstudentpublication | N | |
dc.relation.ispartofpagefrom | 703 | |
dc.relation.ispartofpageto | 735 | |
dc.relation.ispartofissue | 6 | |
dc.relation.ispartofjournal | Theory and Practice of Logic Programming | |
dc.relation.ispartofvolume | 6 | |
dc.rights.retention | Y | |
dc.subject.fieldofresearch | Theory of computation | |
dc.subject.fieldofresearchcode | 4613 | |
dc.title | Embedding defeasible logic into logic programming | |
dc.type | Journal article | |
dc.type.description | C1 - Articles | |
dc.type.code | C - Journal Articles | |
gro.rights.copyright | © 2006 Cambridge University Press. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version. | |
gro.date.issued | 2006 | |
gro.hasfulltext | Full Text | |
gro.griffith.author | Billington, David | |