Terminological Cycles in a Description Logic with Existential Restrictions
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 325-329.
Abstract
Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language F £ 0 , which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles for the language £ C, which allows for conjunction, existential restrictions, and the topconcept. In contrast to the results for F Co, subsumption in £C remains polynomial, independent of whether we use least fixpoint semantics, greatest fix point semantics, or descriptive semantics.
@inproceedings{ijcai2003p48,
title = {Terminological Cycles in a Description Logic with Existential Restrictions},
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 = {325--329},
year = {2003},
url = {https://ijcai.org/proceedings/2003/48},
}
TY - CPAPER TI - Terminological Cycles in a Description Logic with Existential Restrictions 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 - 325 EP - 329 UR - https://ijcai.org/proceedings/2003/48 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
