Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berger, R.: The undecidability of the dominoe problem. Mem. Amer. Math. Soc. 66, 1–72 (1966)
Biskup, J., Polle, T.: Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints. In: Foundations of Information and Knowledge Systems, pp. 31–49 (2000)
Biskup, J., Polle, T.: Adding inclusion dependencies to an object-oriented data model with uniqueness constraints. Acta Informatica 39, 391–449 (2003)
Borgida, A., Weddell, G.E.: Adding Uniqueness Constraints to Description Logics (Preliminary Report). In: International Conference on Deductive and Object-Oriented Databases, pp. 85–102 (1997)
Calvanese, D., Giacomo, G.D., Lenzerini, M.: Identification Constraints and Functional Dependencies in Description Logics. In: Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 155–160 (2001)
Calvanese, D., Giacomo, G.D., Lenzerini, M.: Representing and reasoning on xml documents: A description logic approach. J. Log. Comput. 9(3), 295–318 (1999)
Calvanese, D., Lenzerini, M., De Giacomo, G.: Keys for Free in Description Logics. In: Proceeding of the 2000 International Workshop on Description Logics, pp. 79–88 (2000)
DeHaan, D., Toman, D., Weddell, G.E.: Rewriting Aggregate Queries using Description Logics. In: Description Logics 2003. CEUR-WS, vol. 81, pp. 103–112 (2003)
Ito, M., Weddell, G.E.: Implication Problems for Functional Constraints on Databases Supporting Complex Objects. Journal of Computer and System Sciences 49(3), 726–768 (1994)
Khizder, V.L., Toman, D., Weddell, G.E.: Reasoning about Duplicate Elimination with Description Logic. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1017–1032. Springer, Heidelberg (2000)
Khizder, V.L., Toman, D., Weddell, G.E.: On Decidability and Complexity of Description Logics with Uniqueness Constraints. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 54–67. Springer, Heidelberg (2000)
Liu, H., Toman, D., Weddell, G.E.: Fine Grained Information Integration with Description Logic. In: Description Logics 2002. CEUR-WS, vol. 53, pp. 1–12 (2002)
Lutz, C., Milicic, M.: Description Logics with Concrete Domains and Functional Dependencies. In: Proc. European Conference on Artificial Intelligence (ECAI), pp. 378–382 (2004)
Lutz, C., Areces, C., Horrocks, I., Sattler, U.: Keys, Nominals, and Concrete Domains. In: Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 349–354 (2003)
Sattler, U., Calvanese, D., Molitor, R.: Relationships with other formalisms. In: The Description Logic Handbook: Theory, Implementation, and Applications, ch. 4, pp. 137–177. Cambridge University Press, Cambridge (2003)
Stanchev, L., Weddell, G.E.: Index Selection for Embedded Control Applications using Description Logics. In: Description Logics 2003. CEUR-WS, vol. 81, pp. 9–18 (2003)
Toman, D., Weddell, G.: On the Interaction between Inverse Features and Path-functional Dependencies in Description Logics. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 603–608 (2005)
Toman, D., Weddell, G.E.: On Attributes, Roles, and Dependencies in Description Logics and the Ackermann Case of the Decision Problem. In: Description Logics 2001. CEUR-WS, vol. 49, pp. 76–85 (2001)
Toman, D., Weddell, G.E.: Attribute Inversion in Description Logics with Path Functional Dependencies. In: Description Logics 2004. CEUR-WS, vol. 104, pp. 178–187 (2004)
Toman, D., Weddell, G.E.: On Path-functional Dependencies as First-class Citizens in Description Logics. In: Description Logics 2005. CEUR-WS, vol. 147 (2005)
Toman, D., Weddell, G.E.: On Reasoning about Structural Equality in XML: A Description Logic Approach. Theoretical Computer Science 336, 181–203 (2005), doi:10.1016/j.tcs.2004.10.036.
van Emde Boas, P.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. Lecture notes in pure and applied mathe-matics, vol. 187, pp. 331–363. Marcel Dekker, New York (1997)
Weddell, G.: A Theory of Functional Dependencies for Object Oriented Data Models. In: International Conference on Deductive and Object-Oriented Databases, pp. 165–184 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toman, D., Weddell, G. (2006). On Keys and Functional Dependencies as First-Class Citizens in Description Logics. In: Furbach, U., Shankar, N. (eds) Automated Reasoning. IJCAR 2006. Lecture Notes in Computer Science(), vol 4130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814771_52
Download citation
DOI: https://doi.org/10.1007/11814771_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37187-8
Online ISBN: 978-3-540-37188-5
eBook Packages: Computer ScienceComputer Science (R0)