Towards an Efficient Prover for the C1 Paraconsistent Logic

Authors:
Adolfo Neto;Celso A. A. Kaestner;Marcelo Finger
Affiliations:
Informatics Department (DAINF), Federal University of Technology -- Paraná (UTFPR), Curitiba, Brazil;Informatics Department (DAINF), Federal University of Technology -- Paraná (UTFPR), Curitiba, Brazil;Computer Science Department (DCC), University of São Paulo (USP), São Paulo, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 3
Cited 0

Test Driven Development: By Example

Test Driven Development: By Example
Merging Healthcare Ontologies: Inconsistency Tolerance and Implementation Issues

CBMS '07 Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems
Analytical Tableaux for da Costa's Hierarchy of Paraconsistent Logics

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The KE inference system is a tableau method developed by Marco Mondadori which was presented as an improvement, in the computational efficiency sense, over Analytic Tableaux. In the literature, there is no description of a theorem prover based on the KE method for the C"1 paraconsistent logic. Paraconsistent logics have several applications, such as in robot control and medicine. These applications could benefit from the existence of such a prover. We present a sound and complete KE system for C"1, an informal specification of a strategy for the C"1 prover as well as problem families that can be used to evaluate provers for C"1. The C"1KE system and the strategy described in this paper will be used to implement a KE based prover for C"1, which will be useful for those who study and apply paraconsistent logics.