Towards an Efficient Prover for the C1 Paraconsistent Logic

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.

[1]  Adolfo Gustavo Serra Seca Neto,et al.  A Multi-Strategy Tableau Prover , 2005 .

[2]  Marcello D'Agostino,et al.  The Taming of the Cut. Classical Refutations with Analytic Cut , 1994, J. Log. Comput..

[3]  Marcello D'Agostino,et al.  Are tableaux an improvement on truth-tables? , 1992, J. Log. Lang. Inf..

[4]  Otávio Bueno,et al.  Philosophy of Logic , 2010 .

[5]  Tarcisio Pequeno,et al.  A reasoning method for a paraconsistent logic , 1993, Stud Logica.

[6]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

[7]  Mamede Lima-Marques,et al.  Reasoning under Inconsistent Knowledge , 1992, J. Appl. Non Class. Logics.

[8]  M. Finger,et al.  A KE Tableau for a Logic of Formal Inconsistency , 2007 .

[9]  Wendy MacCaull,et al.  Merging Healthcare Ontologies: Inconsistency Tolerance and Implementation Issues , 2007, Twentieth IEEE International Symposium on Computer-Based Medical Systems (CBMS'07).

[10]  Marcello D'Agostino,et al.  Tableau Methods for Classical Propositional Logic , 1999 .

[11]  D. Gabbay,et al.  Handbook of tableau methods , 1999 .

[12]  Marcelo Finger,et al.  Effective Prover for Minimal Inconsistency Logic , 2006, IFIP AI.

[13]  W. Carnielli,et al.  Logics of Formal Inconsistency , 2007 .

[14]  Max Bramer,et al.  Artificial Intelligence in Theory and Practice II , 2009 .

[15]  Newton C. A. da Costa,et al.  A semantical analysis of the calculi Cn , 1977, Notre Dame J. Formal Log..

[16]  N. Costa,et al.  Paraconsistent Logics and Paraconsistency , 2007 .

[17]  Martin A. Musicante,et al.  Bibel's matrix connection method in paraconsistent logic: general concepts and implementation , 2001, SCCC 2001. 21st International Conference of the Chilean Computer Science Society.

[18]  R. Smullyan.  First-Order Logic , 1968 .

[19]  Itala M. Loffredo D'Ottaviano,et al.  Analytical Tableaux for da Costa's Hierarchy of Paraconsistent Logics , 2006, Electron. Notes Theor. Comput. Sci..

[20]  G. Lambert-Torres,et al.  Intelligent System of Paraconsistent Logic to Control Autonomous Moving Robots , 2006, IECON 2006 - 32nd Annual Conference on IEEE Industrial Electronics.

[21]  Marcelo E. Coniglio,et al.  Two's Company: “The Humbug of Many Logical Values” , 2005 .

[22]  Krysia Broda,et al.  A Solution To A Problem Of Popper , 1995 .

[23]  Kent L. Beck,et al.  Test-driven Development - by example , 2002, The Addison-Wesley signature series.