Advertisement

Conjunctive Query Answering in \({\mathcal{CFD}}_{nc}\): A PTIME Description Logic with Functional Constraints and Disjointness

  • David Toman
  • Grant Weddell
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8272)

Abstract

We consider conjunctive query answering and other basic reasoning services in \({\mathcal{CFD}}_{nc}\), an alternative to the description logic \({\mathcal{CFD}}\) that retains the latter’s ability to support PTIME reasoning in the presence of terminological cycles with universal restrictions over functional roles and also in the presence of functional constraints over functional role paths. In contrast, \({\mathcal{CFD}}_{nc}\) replaces the ability to have conjunction on left-hand-sides of inclusion dependencies with the ability to have primitive negation on right-hand-sides. This makes it possible to say that primitive concepts must denote disjoint sets of individuals, a common requirement with many information sources.

Keywords

Description Logic Transition Relation Logical Implication Conjunctive Query Concept Description 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res (JAIR) 36, 1–69 (2009)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Baader, F., Brandt, S., Lutz, C.: Pushing the \(\cal EL\) Envelope. In: Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 364–369 (2005)Google Scholar
  3. 3.
    Borgida, A., Weddell, G.: Adding Uniqueness Constraints to Description Logics (Preliminary Report). In: Bry, F., Ramakrishnan, R., Ramamohanarao, K. (eds.) DOOD 1997. LNCS, vol. 1341, pp. 85–102. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  4. 4.
    Calvanese, D., de Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family. Journal of Automated Reasoning 39(3), 385–429 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Path-Based Identification Constraints in Description Logics. In: Proc. of the 11th Int. Joint Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 231–241 (2008)Google Scholar
  6. 6.
    Calvanese, D., De Giacomo, G., Lenzerini, M.: Identification Constraints and Functional Dependencies in Description Logics. In: Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 155–160 (2001)Google Scholar
  7. 7.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)Google Scholar
  8. 8.
    Ito, M., Weddell, G.: Implication Problems for Functional Constraints on Databases Supporting Complex Objects. Journal of Computer and System Sciences 49(3), 726–768 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Khizder, V.L., Toman, D., Weddell, G.: 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)CrossRefGoogle Scholar
  10. 10.
    Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-Lite. In: KR (2010)Google Scholar
  11. 11.
    Kozen, D.: Lower bounds for natural proof systems. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp. 254–266. IEEE Computer Society (1977)Google Scholar
  12. 12.
    Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic EL using a relational database system. In: Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 2070–2075 (2009)Google Scholar
  13. 13.
    Toman, D., Weddell, G.: On Reasoning about Structural Equality in XML: A Description Logic Approach. Theoretical Computer Science 336(1), 181–203 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Toman, D., Weddell, G.: On the Interaction between Inverse Features and Path-functional Dependencies in Description Logics. In: Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 603–608 (2005)Google Scholar
  15. 15.
    Toman, D., Weddell, G.: On Keys and Functional Dependencies as First-Class Citizens in Description Logics. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 647–661. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Toman, D., Weddell, G.E.: On keys and functional dependencies as first-class citizens in description logics. J. Autom. Reasoning 40(2-3), 117–132 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Toman, D., Weddell, G.E.: Applications and extensions of ptime description logics with functional constraints. In: Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 948–954 (2009)Google Scholar
  18. 18.
    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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • David Toman
    • 1
  • Grant Weddell
    • 1
  1. 1.Cheriton School of Computer ScienceUniversity of WaterlooCanada

Personalised recommendations