Abstract
The logic of comparative concept similarity \(\mathcal{CSL}\) has been introduced in 2005 by Shemeret, Tishkovsky, Zakharyashev and Wolter in order to express a kind of qualitative similarity reasoning about concepts in ontologies. The semantics of the logic is defined in terms of distance spaces; however it can be equivalently reformulated in terms of preferential structures, similar to those ones of conditional logics. In this paper we consider \(\mathcal{CSL}\) interpreted over symmetric and non-symmetric distance models satisfying the limit assumption, the so-called minspace distance models. We contribute to automated deduction for \(\mathcal{CSL}\) in two ways. First we prove by the finite filtration method that the logic has the effective finite model property with respect to its preferential semantics. Then we present a decision procedure in the form of a labeled tableau calculus for both cases of \(\mathcal{CSL}\) interpreted over symmetric and non-symmetric minspace distance models. The termination of the calculus is obtained by imposing suitable blocking conditions.
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., Pozatto, G.L.: Csl-lean: a prover for the logic of comparative similarity. In: Proceedings of M4M-6 (Methods for Modalities) (2009)
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)
Horrocks, I., Sattler, U.: A description logic with transitive and inverse roles and role hierarchies. J. Logic Computation 9(3), 385–410 (1999)
Kurucz, A., Wolter, F., Zakharyaschev, M.: Modal logics for metric spaces: Open problems. In: Artëmov, S.N., Barringer, H., d’Avila Garcez, A.S., Lamb, L.C., Woods, J. (eds.) We Will Show Them! (2), pp. 193–108. College Publ. (2005)
Lewis, D.: Counterfactuals. Basil Blackwell Ltd. (1973)
Schmidt, R.A., Tishkovsky, D.: A general tableau method for deciding description logics, modal logics and related first-order fragments. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 194–209. Springer, Heidelberg (2008)
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., Tishkovsky, D., Wolter, F., Zakharyaschev, M.: A logic for concepts and similarity. J. Log. Comput. 17(3), 415–452 (2007)
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
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alenda, R., Olivetti, N., Schwind, C., Tishkovsky, D. (2010). Tableau Calculi for \(\mathcal{CSL}\) over minspaces. In: Dawar, A., Veith, H. (eds) Computer Science Logic. CSL 2010. Lecture Notes in Computer Science, vol 6247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15205-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-15205-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15204-7
Online ISBN: 978-3-642-15205-4
eBook Packages: Computer ScienceComputer Science (R0)