CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity

Authors:
Régis Alenda;Nicola Olivetti;Gian Luca Pozzato
Affiliations:
LSIS -- UMR CNRS 6168 Université Paul Cézanne (Aix-Marseille 3), Domaine Universitaire de Saint-Jérôme, Avenue Escadrille Normandie-Niemen, 13397 Marseille Cedex 20, France;LSIS -- UMR CNRS 6168 Université Paul Cézanne (Aix-Marseille 3), Domaine Universitaire de Saint-Jérôme, Avenue Escadrille Normandie-Niemen, 13397 Marseille Cedex 20, France;Dipartimento di Informatica, Università degli Studi di Torino, c.so Svizzera 185 10149 Torino, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 7
Cited 2

Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
What does a conditional knowledge base entail?

Artificial Intelligence
KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Automated reasoning about metric and topology

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
CondLean 3.0: improving CondLean for stronger conditional logics

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Comparative similarity, tree automata, and diophantine equations

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The logic CSL of the comparative concept similarity has been introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison between concepts and/or objects. In this logic we can formulate assertions of the form ''objects A are more similar to B than to C''. This kind of assertions can be added to an ontology to express qualitative comparisons between concepts. In this work we present CSL-lean, the first theorem-prover for this logic. It is a direct Prolog implementation of a tableaux-based decision procedure recently proposed for this logic. The Prolog program is inspired by the lean-methodology. CSL-lean also contains a graphical interface written in Java and it is available for free download at http://www.di.unito.it/~pozzato/csllean/.