Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles

Franz BaaderFranz Baader

Download

Franz Baader
Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
In Georg Gottlob and Toby Walsh, eds., Proceedings of the 18th International Joint Conference on Artificial Intelligence, 319-324, 2003. Morgan Kaufman

Details
Bibtex

KurzfassungAbstract
Computing least common subsumers (lcs) and most specific concepts (msc) are inference tasks that can support the bottom-up construction of knowledge bases in description logics. In description logics with existential restrictions, the most specific concept need not exist if one restricts the attention to concept descriptions or acyclic TBoxes. In this paper, we extend the notions lcs and msc to cyclic TBoxes. For the description logic EL (which allows for conjunctions, existential restrictions, and the top-concept), we show that the lcs and msc always exist and can be computed in polynomial time if we interpret cyclic definitions with greatest fixpoint semantics.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ BaadderIJCAI03b,
  author = {Franz {Baader}},
  booktitle = {Proceedings of the 18th International Joint Conference on Artificial Intelligence},
  editor = {Georg {Gottlob} and Toby {Walsh}},
  pages = {319--324},
  publisher = {Morgan Kaufman},
  title = {Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles},
  year = {2003},
}