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
A. Razavian, H. Azizpour, J. Sullivan, and S. Carlsson. (2014)cite arxiv:1403.6382Comment: version 3 revisions: 1)Added results using feature processing and data augmentation 2)Referring to most recent efforts of using CNN for different visual recognition tasks 3) updated text/caption.
M. Huchard, A. Napoli, M. Hacene, and P. Valtchev. Selected Contributions in Data Analysis and Classification, Studies in Classification, Data Analysis, and Knowledge Organization, (October 2007)