Similarity-Based Inconsistency-Tolerant Logics
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.
KeywordsAggregation Function Denotational Semantic World Semantic Investment House Strict Partial Order
Unable to display preview. Download preview PDF.
- 5.Avron, A., Zamansky, A.: Non-deterministic semantics for logical systems (A survey). In: Handbook of Philosophical Logic (Forthcoming)Google Scholar
- 8.Hunter, A., Konieczny, S.: Measuring inconsistency through minimal inconsistent sets. In: Proc. KR 2008, pp. 358–366. AAAI Press, Menlo Park (2008)Google Scholar
- 9.Kleene, S.C.: Introduction to Metamathematics. Van Nostrand (1950)Google Scholar
- 11.McCarthy, J.: A basis for a mathematical theory of computation. In: Computer Programming and Formal Systems, pp. 33–70 (1963)Google Scholar