Show simple item record

dc.contributor.authorBillington, D
dc.contributor.editorZhang, S
dc.contributor.editorJarvis, R
dc.date.accessioned2017-05-03T11:27:45Z
dc.date.available2017-05-03T11:27:45Z
dc.date.issued2005
dc.date.modified2010-08-20T06:28:09Z
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/11589990_83
dc.identifier.urihttp://hdl.handle.net/10072/4258
dc.description.abstractPlausible Logic is a non-monotonic logic with an efficient implementation. Plausible Logic has five proof algorithms, one is monotonic and four are non-monotonic. These five proof algorithms form a hierarchy. Ambiguity propagating proof algorithms are less risky than ambiguity blocking proof algorithms. The hierarchy shows that the benefit of using the riskier algorithms is that more formulas can be proved. Unlike previous Plausible Logics, the Plausible Logic in this paper is relatively consistent, checks for loops, can prove all its facts and all tautologies, and allows countably many formulas and rules to be considered.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.publisher.placeGermany
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom796
dc.relation.ispartofpageto799
dc.relation.ispartofjournalLecture Notes in Computer science
dc.relation.ispartofvolume3809
dc.rights.retentionY
dc.subject.fieldofresearchcode230101
dc.titleThe Proof Algorithms of Plausible Logic Form a Hierarchy
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.date.issued2005
gro.hasfulltextNo Full Text
gro.griffith.authorBillington, David


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