Relational queries computable in polynomial time
Information and Control
Topology via logic
First steps in modal logic
On the relative expressiveness of description logics and predicate logics
Artificial Intelligence
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The complexity of concept languages
Information and Computation
Reasoning in description logics
Principles of knowledge representation
Communication and Concurrency
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Bisimulations for Temporal Logic
Journal of Logic, Language and Information
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Datalog and Description Logics: Expressive Power
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
A uniform framework for concept definitions in description logics
Journal of Artificial Intelligence Research
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Notions of Indistinguishability for Semantic Web Languages
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Referring expressions as formulas of description logic
INLG '08 Proceedings of the Fifth International Natural Language Generation Conference
Description logic TBoxes: model-theoretic characterizations and rewritability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Hi-index | 0.00 |
We introduce a method for characterizing the expressive power of concept expressions in first-order description logics. The method is essentially model-theoretic in nature in that it gives preservation results uniquely identifying a wide range of description logics as fragments of first-order logic. The languages studied in the paper all belong to the well-known @?@?@? and %plane1D;49C;@? hierarchies.