Abstract
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and reasoning, e.g., in concept formation, similarity-based reasoning and areas of bioinformatics such as protein sequence alignment. In this paper we analyse the computational behaviour of the ‘propositional’ logic with the binary operator ‘closer to a set τ 1 than to a set τ 2’ and nominals interpreted over various classes of distance (or similarity) spaces. In particular, using a reduction to the emptiness problem for certain tree automata, we show that the satisfiability problem for this logic is ExpTime-complete for the classes of all finite symmetric and all finite (possibly non-symmetric) distance spaces. For finite subspaces of the real line (and higher dimensional Euclidean spaces) we prove the undecidability of satisfiability by a reduction of the solvability problem for Diophantine equations. As our ‘closer’ operator has the same expressive power as the standard operator > of conditional logic, these results may have interesting implications for conditional logic as well.
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
Cohn, A., Hazarika, S.: Qualitative spatial representation and reasoning: an overview. Fundamenta Informaticae 43, 2–32 (2001)
Davis, M.: Unsolvable problems. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 567–594. North-Holland, Amsterdam (1977)
Delgrande, J.P.: Preliminary considerations on the modelling of belief change operators by metric spaces. In: NMR, pp. 118–125 (2004)
Emerson, E., Jutla, C.: The complexity of tree automata and logics of programs. SIAM Journal of Computing 29, 132–158 (1999)
Friedman, N., Halpern, J.: On the complexity of conditional logics. In: Proceedings of KR 1994, pp. 202–213 (1994)
Kutz, O., Sturm, H., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M.: Logics of metric spaces. ACM Transactions on Computational Logic 4, 260–294 (2003)
Lewis, D.: Counterfactuals. Blackwell, Oxford (1973)
Lutz, C., Wolter, F., Zakharyaschev, M.: A tableau algorithm for reasoning about concepts and similarity. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 134–149. Springer, Heidelberg (2003)
Matiyasevich, Y.V.: Enumerable sets are Diophantine. Soviet Mathematics Doklady 11, 354–358 (1970)
Schlechta, K.: Coherent Systems. Elsevier, Amsterdam (2004)
Sheremet, M., Tishkovsky, D., Wolter, F., Zakharyaschev, M.: Comparative similarity, tree automata, and diophantine equations (2005), Available at, http://www.csc.liv.ac.uk/frank/publ/publ.html
Spaan, E.: Complexity of Modal Logics. PhD thesis, University of Amsterdam (1993)
Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133–191. Elsevier, Amsterdam (1990)
Tversky, A.: Features of similarity. Psychological Review 84, 327–352 (1977)
Vardi, M., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences 32, 183–221 (1986)
Williamson, T.: First-order logics for comparative similarity. Notre Dame Journal of Formal Logic 29, 457–481 (1988)
Wolter, F., Zakharyaschev, M.: Reasoning about distances. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 1275–1280. Morgan Kaufmann, San Francisco (2003)
Wolter, F., Zakharyaschev, M.: A logic for metric and topology. Journal of Symbolic Logic 70, 795–828 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sheremet, M., Tishkovsky, D., Wolter, F., Zakharyaschev, M. (2005). Comparative Similarity, Tree Automata, and Diophantine Equations. In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_45
Download citation
DOI: https://doi.org/10.1007/11591191_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30553-8
Online ISBN: 978-3-540-31650-3
eBook Packages: Computer ScienceComputer Science (R0)