dc.contributor.author Antoniou, Grigoris en_US dc.contributor.author Billington, David en_US dc.contributor.author Governatori, Guido en_US dc.contributor.author J. Maher, Michael en_US dc.date.accessioned 2017-05-03T11:27:46Z dc.date.available 2017-05-03T11:27:46Z dc.date.issued 2006 en_US dc.date.modified 2008-07-20T22:59:03Z dc.identifier.issn 14710684 en_US dc.identifier.doi 10.1017/S1471068406002778 en_AU 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. en_US dc.description.peerreviewed Yes en_US dc.description.publicationstatus Yes en_AU dc.format.extent 266672 bytes dc.format.mimetype application/pdf dc.language English en_US dc.language.iso en_AU dc.publisher Cambridge University Press en_US dc.publisher.place UK en_US dc.publisher.uri http://journals.cambridge.org/action/displayJournal?jid=TLP en_AU dc.relation.ispartofstudentpublication N en_AU dc.relation.ispartofpagefrom 703 en_US dc.relation.ispartofpageto 735 en_US dc.relation.ispartofissue 6 en_US dc.relation.ispartofjournal Theory and Practice of Logic Programming en_US dc.relation.ispartofvolume 6 en_US dc.rights.retention Y en_AU dc.subject.fieldofresearchcode 280402 en_US dc.title Embedding defeasible logic into logic programming en_US dc.type Journal article en_US dc.type.description C1 - Peer Reviewed (HERDC) en_US dc.type.code C - Journal Articles en_US gro.rights.copyright 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. en_AU gro.date.issued 2006 gro.hasfulltext Full Text
﻿

### This item appears in the following Collection(s)

• Journal articles