Attributive concept descriptions with complements
Artificial Intelligence
The complexity of concept languages
Information and Computation
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An Industrial Strength Description Logics-Based Configurator Platform
IEEE Intelligent Systems
DAML+OIL: A Reason-able Web Ontology Language
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Reasoning with Individuals for the Description Logic SHIQ
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The summary abox: cutting ontologies down to size
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
| Hi-index | 0.00 |
Description Logics knowledge bases are traditionally divided into a terminological part (Tbox), and an assertional part (Abox). However, most of recent results on practical algorithms are confined to terminological reasoning only. Due to the applications of Description Logics for databases and the so-called "Semantic Web", there is a growing interest for practical algorithms for Abox reasoning. In this paper we present an algorithm for deciding knowledge base satisfiability based on the idea of separating terminological and assertional reasoning. This modularity allows to build complete Description Logics systems, by reusing available terminological reasoners.