On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Conjunctive Query Language for Description Logic Aboxes
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Reasoning with Individuals for the Description Logic SHIQ
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Database Systems: The Complete Book
Database Systems: The Complete Book
The OWL instance store: system description
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Towards scalable instance retrieval over ontologies
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
| Hi-index | 0.00 |
Although description logic systems can adequately be used for representing and reasoning about incomplete information (e.g., for John we know he is French or Italian), in practical applications it can be assumed that (only) for some tasks the expressivity of description logics really comes into play whereas for building complete applications, it is often necessary to effectively solve instance retrieval problems with respect to largely deterministic knowledge. In this paper we present and analyze the main results we have found about how to contribute to this kind of scalability problem. We assume familiarity with description logics in general and tableau provers in particular.