Towards Farsighted Dependencies for Existential Rules

  • Jean-Franc̨ois Baget
  • Marie-Laure Mugnier
  • Michaël Thomazo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6902)


We consider existential rules (also called Tuple-Generating Dependencies or Datalog+/- rules). These rules are particularly well-suited to the timely ontological query answering problem, which consists of querying data while taking terminological knowledge into account. Since this problem is not decidable in general, various conditions ensuring decidability have been proposed in the literature. In this paper, we focus on conditions that restrict the way rules may interact to ensure that the forward chaining mechanism is finite. After a review of existing proposals, we propose a generalization of the notion of rule dependency, namely k-dependency, that allows to enlarge halting cases. It can also be used to compile the rule base, which leads to improve query answering algorithms.


Description Logic Rule Application Conjunctive Query Query Answering Existential Variable 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AHV95]
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)zbMATHGoogle Scholar
  2. [Bag04]
    Baget, J.-F.: Improving the forward chaining algorithm for conceptual graphs rules. In: KR 2004, pp. 407–414. AAAI Press, Menlo Park (2004)Google Scholar
  3. [BBL05]
    Baader, F., Brandt, S., Lutz, C.: Pushing the el envelope. In: IJCAI 2005, pp. 364–369 (2005)Google Scholar
  4. [BLM10]
    Baget, J.-F., Leclère, M., Mugnier, M.-L.: Walking the decidability line for rules with existential variables. In: KR 2010, pp. 466–476. AAAI Press, Menlo Park (2010)Google Scholar
  5. [BLMS09]
    Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: Extending decidable cases for rules with existential variables. In: IJCAI 2009, pp. 677–682 (2009)Google Scholar
  6. [BLMS11]
    Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artificial Intelligence 175(9-10), 1620–1654 (2011)CrossRefzbMATHGoogle Scholar
  7. [BM02]
    Baget, J.-F., Mugnier, M.-L.: The Complexity of Rules and Constraints. J. Artif. Intell. Res (JAIR) 16, 425–465 (2002)zbMATHGoogle Scholar
  8. [BMRT11]
    Baget, J.-F., Mugnier, M.-L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: IJCAI 2011 (to appear 2011)Google Scholar
  9. [BMT11]
    Baget, J.-F., Mugnier, M.-L., Thomazo, M.: Towards Farsighted Dependencies for Existential Rules. Research Report RR-LIRMM 11-016 (2011)Google Scholar
  10. [BS06]
    Baget, J.-F., Salvat, E.: Rules dependencies in backward chaining of conceptual graphs rules. In: Schärfe, H., Hitzler, P., Øhrstrøm, P. (eds.) ICCS 2006. LNCS (LNAI), vol. 4068, pp. 102–116. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. [BV81]
    Beeri, C., Vardi, M.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73–85. Springer, Heidelberg (1981)CrossRefGoogle Scholar
  12. [BV84]
    Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. Journal of the ACM 31(4), 718–741 (1984)CrossRefzbMATHGoogle Scholar
  13. [CGK08]
    Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: KR 2008, pp. 70–80 (2008)Google Scholar
  14. [CGL+07]
    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)CrossRefzbMATHGoogle Scholar
  15. [CGL09]
    Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: PODS 2009, pp. 77–86 (2009)Google Scholar
  16. [CGL+10]
    Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+/-: A family of logical knowledge representation and query languages for new applications. In: LICS, pp. 228–242. IEEE Computer Society, Los Alamitos (2010)Google Scholar
  17. [CGP10]
    Calì, A., Gottlob, G., Pieris, A.: Query answering under non-guarded rules in datalog+/-. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 1–17. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  18. [CLM81]
    Chandra, A.K., Lewis, H.R., Makowsky, J.A.: Embedded implicational dependencies and their inference problem. In: STOC 1981, pp. 342–354. ACM, New York (1981)Google Scholar
  19. [CM09]
    Chein, M., Mugnier, M.-L.: Graph-based Knowledge Representation and Reasoning—Computational Foundations of Conceptual Graphs. In: Advanced Information and Knowledge Processing, Springer, Heidelberg (2009)Google Scholar
  20. [DNR08]
    Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: PODS 2008, pp. 149–158 (2008)Google Scholar
  21. [DT03]
    Deutsch, A., Tannen, V.: Reformulation of xml queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225–238. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  22. [FKMP03]
    Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  23. [FKMP05]
    Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)CrossRefzbMATHGoogle Scholar
  24. [JK84]
    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)CrossRefzbMATHGoogle Scholar
  25. [KR11]
    Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI 2011 (to appear 2011)Google Scholar
  26. [KRH07]
    Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for Horn description logics. In: AAAI 2007, pp. 452–457. AAAI Press, Menlo Park (2007)Google Scholar
  27. [LTW09]
    Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic el using a relational database system. In: IJCAI 2009, pp. 2070–2075 (2009)Google Scholar
  28. [Mar09]
    Marnette, B.: Generalized schema-mappings: from termination to tractability. In: PODS, pp. 13–22 (2009)Google Scholar
  29. [MSL09]
    Meier, M., Schmidt, M., Lausen, G.: On chase termination beyond stratification. In: PVLDB, vol. 2(1), pp. 970–981 (2009)Google Scholar
  30. [SM96]
    Salvat, E., Mugnier, M.-L.: Sound and Complete Forward and Backward Chainings of Graph Rules. In: Eklund, P., Mann, G.A., Ellis, G. (eds.) ICCS 1996. LNCS (LNAI), vol. 1115, pp. 248–262. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  31. [Sow84]
    Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading (1984)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jean-Franc̨ois Baget
    • 1
    • 3
  • Marie-Laure Mugnier
    • 2
    • 3
  • Michaël Thomazo
    • 2
    • 3
  1. 1.INRIAFrance
  2. 2.University Montpellier 2France
  3. 3.LIRMMFrance

Personalised recommendations