Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 319-323.
Abstract
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 ££ (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.
@inproceedings{ijcai2003p47,
title = {Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles},
author = {Baader, Franz},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {319--323},
year = {2003},
url = {https://ijcai.org/proceedings/2003/47},
}
TY - CPAPER TI - Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles AU - Baader, Franz T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 319 EP - 323 UR - https://ijcai.org/proceedings/2003/47 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
