Abstract
There have been a number of very credible attempts to devise paraconsistent logics to deal with the problems caused by the unavoidability of contradictions in knowledge bases and elsewhere. This paper suggests a set of principles for generating logical operator semantics which are broadly drawn from classical logic. These lead directly to a paraconsistent logic, LM4, which significantly outperforms other systems and solves the problem for all practical purposes without giving rise to the difficulties inherent in other attempted solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
FN>1 I will not deal here with the issue of contracting knowledge bases as it has little bearing on the main issue I want to address.
- 2.
LM3 is the subject of a separate paper.
References
Quine WVO (1948) On what there is. The Review of Metaphysics 2:21–28, Reprint in: From a logical Point of View, Cambridge, Harvard University Press (1980), p 18
Priest G (1979) The logic of paradox. J Philos Logic, p 226
Priest G (1979) The logic of paradox. Journal Philos Logic, p 235
Lewis D (1982) A logic for equivocators. Noûs 16(3):431–441
Lenat DB, Feigenbaum EA (1991) On the thresholds of knowledge. Artif Int 47:217–222
Copeland BJ (1993) Artificial intelligence: A philosophical introduction. Blackwell, Oxford, p 120
Lemmon EJ (1992) Beginning Logic. Hackett, pp 1–83
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Anderson, D. (2009). Handling Contradictions in Knowledge Discovery Applications. In: Mastorakis, N., Mladenov, V., Kontargyri, V. (eds) Proceedings of the European Computing Conference. Lecture Notes in Electrical Engineering, vol 28. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-85437-3_25
Download citation
DOI: https://doi.org/10.1007/978-0-387-85437-3_25
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-84818-1
Online ISBN: 978-0-387-85437-3
eBook Packages: EngineeringEngineering (R0)