Proceedings of the 30th IEEE symposium on Foundations of computer science
Adding Uniqueness Constraints to Description Logics (Preliminary Report)
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
On Decidability and Complexity of Description Logics with Uniqueness Constraints
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Reasoning about Duplicate Elimination with Description Logic
CL '00 Proceedings of the First International Conference on Computational Logic
Relationships with other formalisms
The description logic handbook
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
Keys, nominate, and concrete domains
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Identification constraints and functional dependencies in description logics
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
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
Propagating functional dependencies with conditions
Proceedings of the VLDB Endowment
Applications and extensions of PTIME description logics with functional constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On order dependencies for the semantic web
ER'07 Proceedings of the 26th international conference on Conceptual modeling
| Hi-index | 0.00 |
We investigate whether identification constraints such as keys and functional dependencies can be granted full status as a concept constructor in a Boolean-complete description logic. In particular, we show that surprisingly simple forms of such constraints lead to undecidability of the associated logical implication problem if they are allowed within the scope of a negation or on the left-hand-side of inclusion dependencies. We then show that allowing a very general form of identification constraints to occur in the scope of monotone concept constructors on the right-hand-side of inclusion dependencies still leads to decidable implication problems. Finally, we consider the relationship between certain classes of identification constraints and nominals.