Sheremet, M. and Tishkovsky, D. and Wolter, F. and Zakharyaschev, Michael (2007) A logic for concepts and similarity. Journal of Logic and Computation 17 (3), pp. 415-452. ISSN 0955-792X.
Abstract
Categorization of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologies or knowledge bases which describe the existing relationships among terms. Description logic (DL) has become one of the most successful formalisms for representing such knowledge bases, in particular because theoretically well-founded and efficient reasoning tools have been readily available. In numerical approaches, classifications are obtained by first computing similarity (or proximity) measures between objects and then categorizing them into classes by means of Voronoi tessellations, clustering algorithms, nearest neighbour computations, etc. In many areas such as bioinformatics, computational linguistics or medical informatics, these two methods have been used independently of each other: although both of them are often applied to the same domain (and even by the same researcher), up to now no formal interaction mechanism has been developed. In this article, we propose a DL-based integration of the two classification methods. Our formalism, called SL+ALCQIO, extends the expressive DL ALCQIO by means of the constructors of the similarity logic SL which allow definitions of concepts in terms of both comparative and absolute similarity. In the combined knowledge base the user should declare the similarity spaces where the new operators are interpreted. Of course, SL+ALCQIO can only be useful if classifications with this logic are supported by automated reasoning tools. We lay theoretical foundations for the development of such tools by showing that reasoning problems for SL+ALCQIO can be decomposed into the corresponding problems for its DL-part ALCQIO and similarity part SL. Then we investigate reasoning in SL and prove that consistency and many other reasoning problems are ExpTime-complete for this logic. Using this result and a recent complexity result of Pratt-Hartmann for ALCQIO, we prove that reasoning in SL+ALCQIO is NExpTime-complete. As the ‘closer’ operator of SL has the same expressive power as the standard implication > of conditional logic, these results may have interesting consequences for conditional logic as well.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 25 Oct 2021 16:18 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46475 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
