Computing Least Common Subsumers in Description Logics with Existential Restrictions

Franz BaaderFranz Baader, R. KüstersR. Küsters, R. MolitorR. Molitor

Franz Baader, R. Küsters, R. Molitor
Computing Least Common Subsumers in Description Logics with Existential Restrictions
In T. Dean, eds., Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99), 96-101, 1999. Morgan Kaufmann

Details
Bibtex

KurzfassungAbstract
Computing the least common subsumer (lcs) is an inference task that can be used to support the "bottom-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 restrictions. 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. The lcs operation then corresponds to the product operation on trees.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ BaaderKuesters+-IJCAI-1999,
  author = {F. {Baader} and R. {K{\"u}sters} and R. {Molitor}},
  booktitle = {Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99)},
  editor = {T. {Dean}},
  pages = {96--101},
  publisher = {Morgan Kaufmann},
  title = {Computing Least Common Subsumers in Description Logics with Existential Restrictions},
  year = {1999},
}