A fixed-point semantics for plausible logic

Authors:
David Billington
Affiliations:
School of Information and Communication Technology, Griffith University, Brisbane, Queensland, Australia
Venue:
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Year:
2005

Citing 3
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Relating Defeasible and Default Logic

AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
The proof algorithms of plausible logic form a hierarchy

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Plausible Logic is a non-monotonic logic with an efficient implementation, but no semantics. This paper gives Plausible Logic a fixed-point semantics, similar to the extensions of Reiter’s Default Logic. The proof theory is sound but deliberately incomplete with respect to this semantics. This is because the semantics is an attempt to define what follows from a plausible theory, rather than merely giving a different characterisation of what is provable.