Show simple item record

dc.contributor.authorAntoniou, Grigorisen_US
dc.contributor.authorBillington, Daviden_US
dc.contributor.authorGovernatori, Guidoen_US
dc.contributor.authorJ. Maher, Michaelen_US
dc.date.accessioned2017-05-03T11:27:46Z
dc.date.available2017-05-03T11:27:46Z
dc.date.issued2006en_US
dc.date.modified2008-07-20T22:59:03Z
dc.identifier.issn14710684en_US
dc.identifier.doi10.1017/S1471068406002778en_AU
dc.identifier.urihttp://hdl.handle.net/10072/14392
dc.description.abstractDefeasible 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.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent266672 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherCambridge University Pressen_US
dc.publisher.placeUKen_US
dc.publisher.urihttp://journals.cambridge.org/action/displayJournal?jid=TLPen_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom703en_US
dc.relation.ispartofpageto735en_US
dc.relation.ispartofissue6en_US
dc.relation.ispartofjournalTheory and Practice of Logic Programmingen_US
dc.relation.ispartofvolume6en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode280402en_US
dc.titleEmbedding defeasible logic into logic programmingen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.rights.copyrightCopyright 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.issued2006
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record