Abstract
Here we present a new paraconsistent logic, called quasi-classical logic (or QC logic) that allows the derivation of non-trivializable classical inferences. For this it is necessary that queries are in conjunctive normal form and the reasoning process is essentially that of clause finding. We present a proof-theoretic definition, and semantics, and show that the consequence relation observes reflexivity, monotonicity and transitivity, but fails cut and supraclassicality. Finally we discuss some of the advantages of this logic, over other paraconsistent logics, for applications in information systems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson A R and Belnap N D Jr. (1975) Entailment: The logic of relevance and necessity, Princeton University Press
Belnap N (1977) A useful four-valued logic, in Dunn J and Epstein G, Modern Uses of Multiple-Valued Logic, 5–37, Reidel
Benferhat S, Dubois D, Prade H (1993) Argumentative inference in uncertain and inconsistent knowledge bases, Proceedings of the 9th Conference on Uncertainty in Artificial Intelligence, 411–419, Morgan Kaufmann
Besnard Ph (1991) Paraconsistent logic approach to knowledge representation, in de Glas M, and Gabbay D, Proceedings of the First World Conference on Fundamentals of Artificial Intelligence, Angkor
Besnard Ph and Hunter A (1995) Properties of quasi-classical logic, Technical Report, Department of Computing, Imperial College, London
da Costa N C (1974) On the theory of inconsistent formal systems, Notre Dame Journal of Formal Logic, 15, 497–510
Finkelstein A, Gabbay D, Hunter A, Kramer J, and Nuseibeh B (1993) Inconsistency handling in multi-perspective specifications, in IEEE Transactions on Software Engineering, 20(8), 569–578
Gabbay D and Hunter A (1991) Making inconsistency respectable, Part 1, in Jorrand Ph. and Keleman J, Fundamentals of Artificial Intelligence Research, Lecture Notes in Artificial Intelligence, 535, 19–32, Springer
Lee R C T (1967) A completeness theorem and a computer program for finding theorems derivable from given axioms. PhD dissertation, University of California, Berkeley
Schutte K (1950) Schlussweisen-Kalkuele der Praedikatenlogik, Mathematische Annalen, 122, 47–65
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besnard, P., Hunter, A. (1995). Quasi-classical logic: Non-trivializable classical reasoning from inconsistent information. In: Froidevaux, C., Kohlas, J. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1995. Lecture Notes in Computer Science, vol 946. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60112-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-60112-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60112-8
Online ISBN: 978-3-540-49438-6
eBook Packages: Springer Book Archive