A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Modal logic
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
The Complexity of Conjunctive Query Answering in Expressive Description Logics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Query Answering in the Description Logic Horn-$\mathcal{SHIQ}$
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Temporal Description Logics: A Survey
TIME '08 Proceedings of the 2008 15th International Symposium on Temporal Representation and Reasoning
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Data-complexity of the two-variable fragment with counting quantifiers
Information and Computation
Answering regular path queries in expressive description logics: an automata-theoretic approach
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Worst-case optimal conjunctive query answering for an expressive description logic without inverses
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Terminological reasoning in SHIQ with ordered binary decision diagrams
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Query answering in description logics with transitive roles
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The complexity of finite model reasoning in description logics
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
Hi-index | 0.00 |
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for this problem. In this paper, we consider knots, which are an instance of the mosaic technique from Modal Logic. When annotated with suitable query information, knots are a flexible tool for query answering that allows for solving the problem in a simple and intuitive way. The knot approach yields optimal complexity bounds, as we illustrate on the DLs $\mathcal {ALCH}$ and $\mathcal{ALCHI}$, and can be easily extended to accommodate other constructs.