Abstract
The logic CSL of comparative concept similarity has been introduced by Sheremet, et al. to capture a form of qualitative similarity comparison. We present here \(\mathcal{CS}\)ym\(\mathcal{L}\)ean, the first theorem-prover for CSL interpreted on symmetric minspaces. It is a Prolog implementation of a labelled tableau calculus recently proposed for this logic, and it is inspired by the Lean methodology.
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
Alenda, R., Olivetti, N., Pozzato, G.L.: Csl-lean: A theorem-prover for the logic of comparative concept similarity. In: Proc. M4M-6. ENTCS, vol. 262, pp. 3–16 (2010)
Alenda, R., Olivetti, N., Schwind, C.: Comparative concept similarity over minspaces: Axiomatisation and tableaux calculus. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol. 5607, pp. 17–31. Springer, Heidelberg (2009)
Alenda, R., Olivetti, N., Schwind, C., Tishkovsky, D.: Tableau calculi for CSL over minspaces. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 52–66. Springer, Heidelberg (2010)
Sheremet, M., Tishkovsky, D., Wolter, F., Zakharyaschev, M.: Comparative similarity, tree automata, and diophantine equations. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 651–665. Springer, Heidelberg (2005)
Sheremet, M., Wolter, F., Zakharyaschev, M.: A modal logic framework for reasoning about comparative distances and topology. Annals of Pure and Applied Logic 161(4), 534–559 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alenda, R., Olivetti, N. (2011). CSymLean: A Theorem Prover for the Logic CSL over Symmetric Minspaces. In: Brünnler, K., Metcalfe, G. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2011. Lecture Notes in Computer Science(), vol 6793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22119-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22119-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22118-7
Online ISBN: 978-3-642-22119-4
eBook Packages: Computer ScienceComputer Science (R0)