Computational complexity of terminological reasoning in BACK
Artificial Intelligence
CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Attributive concept descriptions with complements
Artificial Intelligence
Hybrid Inferences in KL-ONE-Based Knowledge Representation Systems
GWAI '90 Proceedings of the 14th German Workshop on Artificial Intelligence
The interaction with incomplete knowledge bases: a formal treatment
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
On the relationship between description logic and predicate logic queries
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Semantic web reasoners and languages
Artificial Intelligence Review
An alternative high-level approach to interaction with databases
INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
| Hi-index | 0.00 |
We study concept languages (also called terminological languages) as means for both defining a knowledge base and expressing queries. In particular, we investigate on the possibility of using two different concept languages, one for asserting facts about individual objects, and the other for querying a set of such assertions. Contrary to many negative results on the complexity of terminological reasoning, our work shows that, provided that a limited language is used for the assertions, it is possible to employ a richer query language while keeping the reasoning process tractable. We also show that, on the other hand, there are constructs that make query answering inherently intractable.