Similarity-based inconsistency-tolerant logics

Authors:
Ofer Arieli;Anna Zamansky
Affiliations:
Department of Computer Science, The Academic College of Tel-Aviv, Israel;Department of Software Engineering, Jerusalem College of Engineering, Israel
Venue:
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Year:
2010

Citing 5
Cited 1

Reasoning about truth (research note)

Artificial Intelligence
Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
Many-valued modal logics

Fundamenta Informaticae - Special issue: logics for artificial intelligence
Non-deterministic Multiple-valued Structures

Journal of Logic and Computation
Distance-based paraconsistent logics

International Journal of Approximate Reasoning

Inconsistency-Tolerance in knowledge-based systems by dissimilarities

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems

Quantified Score

Hi-index	0.00

Visualization

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.