On the exploration of the query rewriting space with existential rules

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

Volumn 7994 LNCS, Issue , 2013, Pages 123-137

  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

BREADTH-FIRST; CONJUNCTIVE QUERIES; EXPERIMENTAL COMPARISON; ONTOLOGY-BASED DATA ACCESS; QUERY REWRITINGS; REWRITING ALGORITHM; SET OF RULES; SOUND AND COMPLETE;

ALGORITHMS;

ONTOLOGY;

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

References (19)

1. 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)
2. 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)
3. Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: KR 2008, pp. 70-80 (2008)
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. J. Autom. Reasoning 39(3), 385-429 (2007)
5. Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: PODS 2009, pp. 77-86 (2009)
6. 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)
7. Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: ICDE 2011, pp. 2-13 (2011)
8. Imprialou, M., Stoilos, G., Grau, B.C.: Benchmarking ontology-based query rewriting systems. In: AAAI (2012)
9. König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: A sound and complete backward chaining algorithm for existential rules. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 122-138. Springer, Heidelberg (2012)
10. König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: On the Exploration of the Query Rewriting Space with Existential Rules. Technical Report RR-13016, LIRMM, GraphIK - INRIA Sophia Antipolis (April 2013)
11. Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The Combined Approach to Ontology-Based Data Access. In: IJCAI, pp. 2656-2661 (2011)
12. Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI 2011, pp. 963-968 (2011)
13. 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)
14. 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)
15. Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: KR 2010 (2010)
16. Rodriguez-Muro, M., Calvanese, D.: High performance query answering over DL-lite ontologies. In: KR (2012)
17. 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) (Pubitemid 126107981)
18. Thomazo, M.: Compact rewriting for existential rules. In: IJCAI (2013)
19. Venetis, T., Stoilos, G., Stamou, G.B.: Incremental query rewriting for OWL 2 QL. In: Description Logics (2012)