Skip to main content

On the Interaction of Existential Rules and Equality Constraints in Ontology Querying

  • Chapter

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7265)

Abstract

Ontological query processing is an exciting research topic in database theory, knowledge representation, and logic programming. In many cases, ontological constraints are expressed over an extensional database by extending traditional Datalog rules to allow existential quantification and equality atoms in the head. The unrestricted use of these features causes undecidability of query answering and, therefore, their interaction must be controlled. This work provides a tutorial-like introduction to the problem of query answering under existential and equality constraints. We survey the most notable (semantic and syntactic) restrictions to such constraints ensuring decidability of query answering, and we discuss their practical application to conceptual modelling.

Keywords

  • Equality Constraint
  • Description Logic
  • Conjunctive Query
  • Query Answering
  • Inclusion Dependency

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)

    Google Scholar 

  2. Artale, A., Calvanese, D., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: Reasoning over Extended ER Models. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 277–292. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  3. Beeri, C., Vardi, M.Y.: The Implication Problem for Data Dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73–85. Springer, Heidelberg (1981)

    CrossRef  Google Scholar 

  4. Berardi, D., Calvanese, D., De Giacomo, G.: Reasoning on UML class diagrams. Artif. Intell. 168(1-2), 70–118 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70–80 (2008)

    Google Scholar 

  6. Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of PODS, pp. 77–86 (2009); To appear in the J. of Web Semantics

    Google Scholar 

  7. Calì, A., Gottlob, G., Orsi, G., Pieris, A.: Querying UML Class Diagrams. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 1–25. Springer, Heidelberg (2012)

    CrossRef  Google Scholar 

  8. Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554–565 (2010)

    Google Scholar 

  9. Calì, A., Gottlob, G., Pieris, A.: Querying Conceptual Schemata with Expressive Equality Constraints. In: Jeusfeld, M., Delcambre, L., Ling, T.-W. (eds.) ER 2011. LNCS, vol. 6998, pp. 161–174. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  10. Calì, A., Gottlob, G., Pieris, A.: Ontological query answering under expressive Entity-Relationship schemata. Inf. Syst. 37(4), 320–335 (2012)

    CrossRef  Google Scholar 

  11. Calì, A., Kifer, M.: Containment of conjunctive object meta-queries. In: Proc. of VLDB, pp. 942–952 (2006)

    Google Scholar 

  12. Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS, pp. 260–271 (2003)

    Google Scholar 

  13. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning 39(3), 385–429 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Calvanese, D., De Giacomo, G., Lenzerini, M.: Identification constraints and functional dependencies in description logics. In: Proc. of IJCAI, pp. 155–160 (2001)

    Google Scholar 

  15. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of STOCS, pp. 77–90 (1977)

    Google Scholar 

  16. Chandra, A.K., Vardi, M.Y.: The implication problem for functional and inclusion dependencies. SIAM J. of Comput. 14, 671–677 (1985)

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. Chen, P.P.: The Entity-Relationship model: Towards a unified view of data. ACM Trans. Database Syst. 1(1), 124–131 (1976)

    CrossRef  Google Scholar 

  18. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. Fan, W., Geerts, F., Jia, X.: A revival of integrity constraints for data cleaning. PVLDB 1(2), 1522–1523 (2008)

    Google Scholar 

  20. Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167–189 (1984)

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. J. ACM 42(4), 741–843 (1995)

    CrossRef  MathSciNet  MATH  Google Scholar 

  22. Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proc. of IJCAI, pp. 963–968 (2011)

    Google Scholar 

  23. Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of PODS, pp. 233–246 (2002)

    Google Scholar 

  24. Lloyd, J.W.: Foundations of logic programming. Springer (1987)

    Google Scholar 

  25. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455–469 (1979)

    CrossRef  Google Scholar 

  26. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semantics 10, 133–173 (2008)

    MATH  Google Scholar 

  27. Sowa, J.F.: Knowledge representation: Logical, philosophical and computational foundations. Brooks/Cole Publishing Co. (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Calì, A., Gottlob, G., Orsi, G., Pieris, A. (2012). On the Interaction of Existential Rules and Equality Constraints in Ontology Querying. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30743-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30742-3

  • Online ISBN: 978-3-642-30743-0

  • eBook Packages: Computer ScienceComputer Science (R0)