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
H. Li, Z. Xu, G. Taylor, C. Studer, and T. Goldstein. (2017)cite arxiv:1712.09913Comment: NIPS 2018 (extended version, 10.5 pages), code is available at https://github.com/tomgoldstein/loss-landscape.
S. Dasiopoulou, I. Kompatsiaris, and M. Strintzis. Semantic Multimedia, Third International Conference on Semantic and Digital Media Technologies, SAMT 2008, Koblenz, Germany, page 31-46. (2008)
R. Straeten, T. Mens, J. Simmonds, and V. Jonckers. UML 2003 – The Unified Modeling Language, volume 2863 of Lecture Notes in Computer Science, page 326--340. Springer, (2003)
A. Borgida, T. Walsh, and H. Hirsh. Proceedings of the 2005 International Workshop on Description Logics (DL2005), July 26-28, 2005, Edinburgh, Scotland, UK, volume 147 of CEUR Workshop Proceedings, CEUR-WS.org, (2005)
D. Frankel, P. Hayes, E. Kendall, and D. McGuinness. 1st International Workshop on the Model-Driven Semantic Web (MDSW2004), Monterey, California, USA, (September 2004)