Studia Logica 52 (2):281 - 289 (1993)
|Abstract||A proof method for automation of reasoning in a paraconsistent logic, the calculus C1* of da Costa, is presented. The method is analytical, using a specially designed tableau system. Actually two tableau systems were created. A first one, with a small number of rules in order to be mathematically convenient, is used to prove the soundness and the completeness of the method. The other one, which is equivalent to the former, is a system of derived rules designed to enhance computational efficiency. A prototype based on this second system was effectively implemented.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Nicola Olivetti (2003). Tableaux for Łukasiewicz Infinite-Valued Logic. Studia Logica 73 (1):81 - 111.
Arnon Avron, General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations.
Grigori Mints (1993). Resolution Calculus for the First Order Linear Logic. Journal of Logic, Language and Information 2 (1):59-83.
Newton C. A. da Costa & Décio Krause, Remarks on the Applications of Paraconsistent Logic to Physics.
Arthur Buchsbaum, Tarcisio Pequeno & Marcelino Pequeno (2007). A Logical Expression of Reasoning. Synthese 154 (3):431 - 466.
Andrzej Wiśniewski, Guido Vanackere & Dorota Leszczyńska (2005). Socratic Proofs and Paraconsistency: A Case Study. Studia Logica 80 (2-3):431 - 466.
Riccardo Rosati (2001). A Sound and Complete Tableau Calculus for Reasoning About Only Knowing and Knowing at Most. Studia Logica 69 (1):171-191.
Added to index2009-01-28
Total downloads10 ( #114,329 of 722,774 )
Recent downloads (6 months)0
How can I increase my downloads?