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. Zhang, Y. Dauphin, und T. Ma. (2019)cite arxiv:1901.09321Comment: Accepted for publication at ICLR 2019; see https://openreview.net/forum?id=H1gsz30cKX.
J. Yosinski, J. Clune, Y. Bengio, und H. Lipson. (2014)cite arxiv:1411.1792Comment: To appear in Advances in Neural Information Processing Systems 27 (NIPS 2014).
O. Yadan, K. Adams, Y. Taigman, und M. Ranzato. (2013)cite arxiv:1312.5853Comment: Machine Learning, Deep Learning, Convolutional Networks, Computer Vision, GPU, CUDA.