The Proof Algorithms of Plausible Logic Form a Hierarchy

There are no files associated with this record.

Title The Proof Algorithms of Plausible Logic Form a Hierarchy
Author Billington, David
Journal Name Lecture Notes in Computer Science
Editor J.G.Carbonell and J.Siekmann
Year Published 2005
Place of publication Germany
Publisher Springer
Abstract Plausible 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.
Peer Reviewed Yes
Published Yes
Alternative URI http://dx.doi.org/10.1007/11589990_83
Volume 3809
Page from 796
Page to 799
ISSN 0302-9743
Date Accessioned 2006-03-02
Language en_AU
Faculty Faculty of Engineering and Information Technology
Subject PRE2009-Mathematical Logic, Set Theory, Lattices and Combinatorics
URI http://hdl.handle.net/10072/4258
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1

Show simple item record

Griffith University copyright notice