Proceedings of the 30th IEEE symposium on Foundations of computer science
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 Introduction to the General Theory of Algorithms
An Introduction to the General Theory of Algorithms
Adding Uniqueness Constraints to Description Logics (Preliminary Report)
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the interaction between inverse features and path-functional dependencies in description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On keys and functional dependencies as first-class citizens in description logics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Hi-index | 0.01 |
We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attribute-connected conjunctive queries, showing that both problems are in PTIME. We then consider the effect on the complexity of these problems after adding a concept constructor that expresses concept union, or after adding a concept constructor for the bottom class. Finally, we show that adding both constructors makes both problems EXPTIME-complete.