| dc.contributor.author | Billington, David | |
| dc.contributor.editor | Pfahringer, B | |
| dc.contributor.editor | Renz, J | |
| dc.date.accessioned | 2017-06-12T02:37:28Z | |
| dc.date.available | 2017-06-12T02:37:28Z | |
| dc.date.issued | 2015 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.doi | 10.1007/978-3-319-26350-2_7 | |
| dc.identifier.uri | http://hdl.handle.net/10072/125238 | |
| dc.description.abstract | A 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.peerreviewed | Yes | |
| dc.language | English | |
| dc.language.iso | eng | |
| dc.publisher | Springer | |
| dc.relation.ispartofpagefrom | 76 | |
| dc.relation.ispartofpageto | 82 | |
| dc.relation.ispartofjournal | Lecture Notes in Computer Science | |
| dc.relation.ispartofvolume | 9457 | |
| dc.subject.fieldofresearch | Other information and computing sciences not elsewhere classified | |
| dc.subject.fieldofresearchcode | 469999 | |
| dc.title | A Propositional Plausible Logic | |
| dc.type | Journal article | |
| dc.type.description | C1 - Articles | |
| dc.type.code | C - Journal Articles | |
| dc.description.version | Accepted Manuscript (AM) | |
| gro.faculty | Griffith 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.hasfulltext | Full Text | |
| gro.griffith.author | Billington, David | |
