Show simple item record

dc.contributor.authorBillington, David
dc.contributor.editorPfahringer, B
dc.contributor.editorRenz, J
dc.date.accessioned2017-06-12T02:37:28Z
dc.date.available2017-06-12T02:37:28Z
dc.date.issued2015
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-319-26350-2_7
dc.identifier.urihttp://hdl.handle.net/10072/125238
dc.description.abstractA new non-monotonic propositional logic called PPL — for Propositional Plausible Logic — is defined. An example is worked and four theorems about PPL are stated.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofpagefrom76
dc.relation.ispartofpageto82
dc.relation.ispartofjournalLecture Notes in Computer Science
dc.relation.ispartofvolume9457
dc.subject.fieldofresearchOther information and computing sciences not elsewhere classified
dc.subject.fieldofresearchcode469999
dc.titleA Propositional Plausible Logic
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
dc.description.versionAccepted Manuscript (AM)
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.rights.copyright© 2015 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com
gro.hasfulltextFull Text
gro.griffith.authorBillington, David


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