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, and 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, and 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, and M. Ranzato. (2013)cite arxiv:1312.5853Comment: Machine Learning, Deep Learning, Convolutional Networks, Computer Vision, GPU, CUDA.
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)
H. Spieker, A. Gotlieb, D. Marijan, and M. Mossige. (2018)cite arxiv:1811.04122Comment: Spieker, H., Gotlieb, A., Marijan, D., & Mossige, M. (2017). Reinforcement Learning for Automatic Test Case Prioritization and Selection in Continuous Integration. In Proceedings of 26th International Symposium on Software Testing and Analysis (ISSTA'17) (pp. 12--22). ACM.