Show simple item record

dc.contributor.authorBillington, Daviden_US
dc.contributor.editorJ.G.Carbonell and J.Siekmannen_US
dc.date.accessioned2017-05-03T11:27:45Z
dc.date.available2017-05-03T11:27:45Z
dc.date.issued2005en_US
dc.date.modified2010-08-20T06:26:09Z
dc.identifier.issn03029743en_US
dc.identifier.doi10.1007/11589990_86en_AU
dc.identifier.urihttp://hdl.handle.net/10072/4259
dc.description.abstractPlausible Logic is a non-monotonic logic with an efficient implementation, but no semantics. This paper gives Plausible Logic a fixed-point semantics, similar to the extensions of Reiter's Default Logic. The proof theory is sound but deliberately incomplete with respect to this semantics. This is because the semantics is an attempt to define what follows from a plausible theory, rather than merely giving a different characterisation of what is provable.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherSpringeren_US
dc.publisher.placeGermanyen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom812en_US
dc.relation.ispartofpageto815en_US
dc.relation.ispartofjournalLecture Notes in Computer scienceen_US
dc.relation.ispartofvolume3809en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode230101en_US
dc.titleA Fixed-Point Semantics for Plausible Logicen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.date.issued2005
gro.hasfulltextNo Full Text


Files in this item

FilesSizeFormatView

There are no files associated with 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