Motik, Boris
Reasoning in Description Logics using Resolution and Deductive Databases
Universität Karlsruhe, Fak. f. Wirtschaftswissenschaften. Diss. v. 09.01.2006.
We extend the description logic EL++ with reflexive roles
and range restrictions, and show that subsumption remains tractable if
a certain syntactic restriction is adopted. We also show that subsumption
becomes PSpace-hard (resp. undecidable) if this restriction is weakened
(resp. dropped). Additionally, we prove that tractability is lost when
symmetric roles are added: in this case, subsumption becomes ExpTime-
hard
S. Arora, A. May, J. Zhang, и C. Ré. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, стр. 2650--2663. Online, Association for Computational Linguistics, (июля 2020)
F. Baader, B. Ganter, B.Sertkaya, и U. Sattler. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), стр. 230--235. (2007)
F. Baader. Proceedings of the 11th International Conference on Conceptual Structures (ICCS 2003), том 2746 из Lecture Notes in Computer Science, стр. 117-130. Springer, (2003)
F. Baader. Proceedings of the International Symposium on Knowledge Retrieval, Use, and Storage for Efficiency, KRUSE 95, стр. 168--178. Santa Cruz, USA, (1995)