Computing Least Common Subsumers in Description Logics with Existential Restrictions
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 96-102.
Abstract
Computing the least common subsumer (lcs) is an inference task that can be used to support the "botto m-up" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions , but not for existential restrictions. The main new contribution of this paper is the treatment of description logics with existential r estr ictions. Our approach for computing the lcs is based on an appropriate representation of concept descriptions by certain trees, and a characterization of subsumption by homomorphisms between these trees. Th e lcs operation then corresponds to the product operation on trees.
@inproceedings{ijcai1999p15,
title = {Computing Least Common Subsumers in Description Logics with Existential Restrictions},
author = {Baader, Franz and Küsters, Ralf and Molitor, Ralf},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {96--102},
year = {1999},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1999/15},
}
TY - CPAPER TI - Computing Least Common Subsumers in Description Logics with Existential Restrictions AU - Baader, Franz AU - Küsters, Ralf AU - Molitor, Ralf T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 96 EP - 102 UR - https://ijcai.org/proceedings/1999/15 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
