The Learnability of Description Logics with Equality Constraints
Machine Learning - Special issue on computational learning theory, COLT'92
Machine Learning - Special issue on COLT '94
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
An introduction to description logics
The description logic handbook
The description logic handbook
Explaining reasoning in description logics
Explaining reasoning in description logics
Computing least common subsumers in description logics with existential restrictions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Non-standard inferences in description logics
Non-standard inferences in description logics
Subsumption in w.r.t. hybrid TBoxes
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
In the area of Description Logic (DL) based knowledge representation, hybrid terminologies have been proposed as a means to make non-standard inference services available to knowledge bases that contain general concept inclusion (GCI) axioms. Building on existing work on subsumption in hybrid terminologies, the present paper provides the first in-depth investigation of the non-standard inferences least-common subsumer, and matching in hybrid EL-TBoxes; providing sound and complete algorithms for both inference services.