Towards an efficient prover for the C1 paraconsistent logic

Details Towards an efficient prover for the C1 paraconsistent logic Towards an efficient prover for the C1 paraconsistent logic

2012-02-19

arxiv.org/abs/1202.4144v1

Electronic Notes in Theoretical Computer Science. Volume 256, 2 December 2009, Pages 87-102. Proceedings of the Fourth Worksho

Computer Science

Logic in Computer Science

16 pages

Scientific paper

10.1016/j.entcs.2009.11.007

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 C1 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 C1, an informal specification of a strategy for the C1 prover as well as problem families that can be used to evaluate provers for C1. The C1 KE system and the strategy described in this paper will be used to implement a KE based prover for C1, which will be useful for those who study and apply paraconsistent logics.

Affiliated with

Also associated with

No associations

Rating

Towards an efficient prover for the C1 paraconsistent logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards an efficient prover for the C1 paraconsistent logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards an efficient prover for the C1 paraconsistent logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-419416