The Proof Algorithms of Plausible Logic Form a Hierarchy

No Thumbnail Available
File version
Author(s)
Billington, D
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Zhang, S

Jarvis, R

Date
2005
Size
File type(s)
Location
License
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.

Journal Title

Lecture Notes in Computer science

Conference Title
Book Title
Edition
Volume

3809

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Persistent link to this record
Citation
Collections