Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
Model minimization—an alternative to circumscription
Journal of Automated Reasoning
Reasoning about truth (research note)
Artificial Intelligence
Paraconsistent logic programming
Theoretical Computer Science
A Note on Tableaux of Logic of Paradox
KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Reasoning in the presence of inconsistency
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
A fault-tolerant default logic
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
| Hi-index | 0.01 |
Abstract: G. Priest introduced nonmonotonicity into a paraconsistent logic, so-called logic of paradox LP, that yields a solution to the weakness of paraconsistent logic. The resulting logic (of minimal parades) LP/sub m/ is nonmonotonic in the sense that inconsistency is minimal. The problem of proof theory of logic LP/sub m/ left open because the base logic LP is paraconsistent so that syntactic formulations of nonmonotonic logic are not available for LP/sub m/, though LP/sub m/ is well characterized by minimal semantics. In this paper, we provide a minimal tableaus as a satisfactory proof theory for LP/sub m/. We first present a signed tableaux for LP. Then minimal tableaux for LP/sub m/ is obtained by revising signed tableaux for LP to fit LP/sub m/ in which the branches of non-minimally-inconsistent models of the tableaux are eliminated. The soundness and completeness theorems of the tableaux with respect to the semantics of LP and LP/sub m/ are proved, respectively.