A sound and complete backward chaining algorithm for existential rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7497 LNCS, Issue , 2012, Pages 122-138

  König, Mélanie ^a   Leclère, Michel ^a   Mugnier, Marie Laure ^a   Thomazo, Michaël ^a  

^a UNIV MONTPELLIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BACKWARD CHAINING; CONJUNCTIVE QUERIES; DATALOG; ONTOLOGY-BASED DATA ACCESS; SET OF RULES; SOUND AND COMPLETE;

ONTOLOGY;

EID: 85006841280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33203-6_10     Document Type: Conference Paper

References (18)

1. Baader, F.: Terminological cycles in a description logic with existential restrictions. In: IJCAI 2003, pp. 325-330 (2003)
2. 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 (2010)
3. 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)
4. 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)
5. Baget, J.-F., Mugnier, M.-L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: IJCAI 2011, pp. 712-717 (2011)
6. Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: KR 2008, pp. 70-80 (2008)
7. 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)
8. Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: PODS 2009, pp. 77-86 (2009)
9. 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)
10. Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: ICDE 2011, pp. 2-13 (2011)
11. Gottlob, G., Schwentick, T.: Rewriting ontological queries into small nonrecursive datalog programs. In: KR 2012 (2012)
12. Kikot, S., Kontchakov, R., Zakharyaschev, M.: Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies. In: Rudolph, S., Gutierrez, C. (eds.) RR 2011. LNCS, vol. 6902, pp. 124-138. Springer, Heidelberg (2011)
13. König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: A Sound and Complete Backward Chaining Algorithm for Existential Rules. Technical Report RR-12016, LIRMM, GraphIK-INRIA Sophia Antipolis (2012)
14. Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI 2011, pp. 963-968 (2011)
15. Mugnier, M.-L.: Ontological Query Answering with Existential Rules. In: Rudolph, S., Gutierrez, C. (eds.) RR 2011. LNCS, vol. 6902, pp. 2-23. Springer, Heidelberg (2011)
16. Pérez-Urbina, H., Horrocks, I., Motik, B.: Efficient Query Answering for OWL 2. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 489-504. Springer, Heidelberg (2009)
17. Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: KR 2010 (2010)
18. 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)