What does a conditional knowledge base entail?
Artificial Intelligence
Tableau calculus for preference-based conditional logics: PCL and its extensions
ACM Transactions on Computational Logic (TOCL)
Automated reasoning about metric and topology
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Comparative similarity, tree automata, and diophantine equations
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Tableau calculi for CSL over minspaces
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Tableau calculus for the logic of comparative similarity over arbitrary distance spaces
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
CSymLean: a theorem prover for the logic CSL over symmetric minspaces
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Preferential semantics for the logic of comparative similarity over triangular and metric models
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.01 |
We study the logic of comparative concept similarity $\mathcal{CSL}$ introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In this logic we can formulate assertions of the form "objects A are more similar to B than to C". The semantics of this logic is defined by structures equipped with distance functions evaluating the similarity degree of objects. We consider here the particular case of the semantics induced by minspaces , the latter being distance spaces where the minimum of a set of distances always exists. It turns out that the semantics over arbitrary minspaces can be equivalently specified in terms of preferential structures, typical of conditional logics. We first give a direct axiomatisation of this logic over Minspaces. We next define a decision procedure in the form of a tableaux calculus. Both the calculus and the axiomatisation take advantage of the reformulation of the semantics in terms of preferential structures.