Journal of Applied Non-Classical Logics 11 (3-4):294-312 (2001)

Quasi-classical logic is a propositional logic for reasoning under inconsistency pointed out recently in the literature [3] [21]. Compared with several other paraconsistent logics, it has the nice feature that no special attention needs to be paid to a special form of premises. However, only few is known about its computational behaviour up to now. In this paper, we fill this gap by pointing out a linear time translation that maps every instance of the quasi-classical entailment problem for CNF formulas into an instance of the classical entailment problem. This enables us to show that quasi-classical entailment for CNF formulas is “only” coNP -complete, take advantage of all existing automated reasoning techniques for classical entailment in order to improve quasi-classical inference from the practical side. Especially, tractable classes of formulas for quasi-classical entailment are pointed out.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.3166/jancl.11.295-312
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,489
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

A Useful Four-Valued Logic.N. D. Belnap - 1977 - In J. M. Dunn & G. Epstein (eds.), Modern Uses of Multiple-Valued Logic. D. Reidel.
On the Theory of Inconsistent Formal Systems.Newton C. A. Costa - 1972 - Recife, Universidade Federal De Pernambuco, Instituto De Matemática.
Tractable Reasoning Via Approximation.Marco Schaerf & Marco Cadoli - 1995 - Artificial Intelligence 74 (2):249-310.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Remarks on the Theory of Quasi-Sets.Steven French & Décio Krause - 2010 - Studia Logica 95 (1-2):101 - 124.
Entailment and Bivalence.Fred Seymour Michael - 2002 - Journal of Philosophical Logic 31 (4):289-300.
On the Computational Meaning of Axioms.Alberto Naibo, Mattia Petrolo & Thomas Seiller - 2016 - In Ángel Nepomuceno Fernández, Olga Pombo Martins & Juan Redmond (eds.), Epistemology, Knowledge and the Impact of Interaction. Springer Verlag.
Relevant Generalization Starts Here (and Here = 2).Dmitry Zaitsev & Oleg Grigoriev - 2010 - Logic and Logical Philosophy 19 (4):329-340.
Can We Believe What We Do Not Understand?François Recanati - 1997 - Mind and Language 12 (1):84-100.
A Question of Entailment.John O. Nelson - 1964 - Review of Metaphysics 18 (2):364 - 377.
Computational Discovery of Communicable Scientific Knowledge.Pat Langley, Jeff Shrager & Kazumi Saito - 2002 - In L. Magnani, N. J. Nersessian & C. Pizzi (eds.), Logical and Computational Aspects of Model-Based Reasoning. Kluwer Academic Publishers. pp. 201--225.


Added to PP index

Total views
12 ( #813,265 of 2,520,893 )

Recent downloads (6 months)
1 ( #405,457 of 2,520,893 )

How can I increase my downloads?


My notes