Sheremet, Mikhail and Tishkovsky, D. and Wolter, F. and Zakharyaschev, M. (2005) 'Closer' representation and reasoning. In: Horrocks, I. and Sattler, U. and Wolter, F. (eds.) DL 2005: Proceedings of the 2005 International Workshop on Description Logics. CEUR Workshop Proceedings 147. CEUR-WS.org.
Abstract
We argue that orthodox tools for defining concepts in the framework of description logic should often be augmented with constructors that could allow definitions in terms of similarity (or closeness). We present a corresponding logical formalism with the binary operator ‘more similar or closer to X than to Y ’ and investigate its computational behaviour in different distance (or similarity) spaces. The concept satisfiability problem turns out to be ExpTime-complete for many classes of distances spaces no matter whether they are required to be symmetric and/or satisfy the triangle inequality. Moreover, the complexity remains the same if we extend the language with the operators ‘somewhere in the neighbourhood of radius a’ where a is a non-negative rational number. However, for various natural subspaces of the real line R (and Euclidean spaces of higher dimensions) even the similarity logic with the sole ‘closer’ operator turns out to be undecidable. This quite unexpected result is proved by reduction of the solvability problem for Diophantine equations (Hilbert’s 10th problem). “There is nothing more basic to thought and language than our sense of similarity; our sorting of things into kinds.” (Quine 1969)
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 01 Nov 2021 12:37 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46489 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
