Abstract
Many logics for AI applications that are defined by denotational semantics are trivialized in the presence of inconsistency. It is therefore often desirable, and practically useful, to refine such logics in a way that inconsistency does not cause the derivation of any formula, and, at the same time, inferences with respect to consistent premises are not affected. In this paper, we introduce a general method of doing so by incorporating preference relations defined in terms of similarities. We exemplify our method for three of the most common denotational semantics (standard many-valued matrices, their non-deterministic generalization, and possible worlds semantics), and demonstrate their usefulness for reasoning with inconsistency.
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
Preview
Unable to display preview. Download preview PDF.
References
Arieli, O.: Distance-based paraconsistent logics. International Journal of Approximate Reasoning 48(3), 766–783 (2008)
Arieli, O., Denecker, M.: Reducing preferential paraconsistent reasoning to classical entailment. Logic and Computation 13(4), 557–580 (2003)
Arieli, O., Zamansky, A.: Distance-based non-deterministic semantics for reasoning with uncertainty. Logic Journal of the IGPL 17(4), 325–350 (2009)
Avron, A., Lev, I.: Non-deterministic multi-valued structures. Logic and Computation 15, 241–261 (2005)
Avron, A., Zamansky, A.: Non-deterministic semantics for logical systems (A survey). In: Handbook of Philosophical Logic (Forthcoming)
da Costa, N.C.A.: On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic 15, 497–510 (1974)
Fitting, M.: Many-valued modal logics. Fundam. Inform. 15(3-4), 235–254 (1991)
Hunter, A., Konieczny, S.: Measuring inconsistency through minimal inconsistent sets. In: Proc. KR 2008, pp. 358–366. AAAI Press, Menlo Park (2008)
Kleene, S.C.: Introduction to Metamathematics. Van Nostrand (1950)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1-2), 167–207 (1990)
McCarthy, J.: A basis for a mathematical theory of computation. In: Computer Programming and Formal Systems, pp. 33–70 (1963)
Priest, G.: Reasoning about truth. Artificial Intelligence 39, 231–244 (1989)
Shoham, Y.: Reasoning about Change. MIT Press, Cambridge (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arieli, O., Zamansky, A. (2010). Similarity-Based Inconsistency-Tolerant Logics. In: Janhunen, T., Niemelä, I. (eds) Logics in Artificial Intelligence. JELIA 2010. Lecture Notes in Computer Science(), vol 6341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15675-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-15675-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15674-8
Online ISBN: 978-3-642-15675-5
eBook Packages: Computer ScienceComputer Science (R0)