Introduction to algorithms
Terminological reasoning is inherently intractable (research note)
Artificial Intelligence
On the complexity of the containment problem for conjunctive queries with built-in predicates
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modal logic
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Extensions of Concept Languages for a Mechanical Engineering Application
GWAI '92 Proceedings of the 16th German Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Concept Language Extended with Different Kinds of Transitive Roles
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Complexity of Terminological Reasoning Revisited
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The description logic handbook
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
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'05 Proceedings of the 19th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constructor, which generalizes both the usual existential restrictions and so-called qualified number restrictions. We show that the new constructor can be expressed in , the extension of the basic DL by qualified number restrictions. However, this representation results in an exponential blow-up. By giving direct algorithms for extended with the new constructor, we can show that the complexity of reasoning in this new DL is actually not harder than the one of reasoning in . Moreover, in our chemical process engineering application, a restricted DL that provides only the new constructor together with conjunction, and satisfies an additional restriction on the occurrence of roles names, is sufficient. For this DL, the subsumption problem is polynomial.