A generic querying algorithm for greedy sets of existential rules

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2012, Pages 96-106

  Thomazo, Michaël ^a   Baget, Jean François ^b   Mugnier, Marie Laure ^a   Rudolph, Sebastian ^c  

^a UNIV MONTPELLIER   (France)

^b INRIA   (France)

^c KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE BASED SYSTEMS; ONTOLOGY; OPTIMIZATION;

ANSWERING QUERIES; BOUNDED TREEWIDTH; COMBINED COMPLEXITY; CONJUNCTIVE QUERIES; ONLINE PROCESSING; ONTOLOGY-BASED DATA ACCESS; OPTIMAL COMPLEXITY; TUPLE-GENERATING DEPENDENCIES;

KNOWLEDGE REPRESENTATION;

EID: 84893390254     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Andréka, H.; Németi, I.; and van Benthem, J. 1998. Modal Languages and Bounded Fragments of Predicate Logic. J. of Philosophical Logic 27:217-274.
2. Baader, F.; Calvanese, D.; McGuinness, D.; Nardi, D.; and Patel-Schneider, P., eds. 2007. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, second edition.
3. Baader, F.; Brandt, S.; and Lutz, C. 2005. Pushing the EL envelope. In IJCAI, 364-369.
4. Baget, J.-F.; Leclère, M.; Mugnier, M.-L.; and Salvat, E. 2009. Extending Decidable Cases for Rules with Existential Variables. In IJCAI, 677-682.
5. Baget, J.-F.; Mugnier, M.-L.; Rudolph, S.; and Thomazo, M. 2011. Walking the Complexity Lines for Generalized Guarded Existential Rules. In IJCAI, 712-717.
6. Baget, J.-F.; Leclère, M.; and Mugnier, M.-L. 2010. Walking the Decidability Line for Rules with Existential Variables. In KR. AAAI Press.
7. Beeri, C., and Vardi, M. 1984. A Proof Procedure for Data Dependencies. Journal of the ACM 31(4):718-741.
8. Buchheit, M.; Donini, F. M.; and Schaerf, A. 1993. De-cidable Reasoning in Terminological Knowledge Representation Systems. JAIR 1:109-138.
9. Calì, A.; Gottlob, G.; and Kifer, M. 2008. Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In KR, 70-80.
10. Calì, A.; Gottlob, G.; and Lukasiewicz, T. 2009. A General Datalog-Based Framework for Tractable Query Answering over Ontologies. In PODS, 77-86. ACM.
11. Calvanese, D.; Giacomo, G. D.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family. Journal of Automated Reasoning 39(3):385-429.
12. Courcelle, B. 1990. The Monadic Second-Order Logic of Graphs: I. Recognizable Sets of Finite Graphs. Inf. Comput. 85(1):12-75.
13. Fagin, R.; Kolaitis, P. G.; Miller, R. J.; and Popa, L. 2005. Data Exchange: Semantics and Query Answering. Theor. Comput. Sci. 336(1):89-124.
14. Kontchakov, R.; Lutz, C.; Toman, D.; Wolter, F.; and Zakharyaschev, M. 2011. The Combined Approach to Ontology-Based Data Access. In IJCAI, 2656-2661.
15. Krötzsch, M., and Rudolph, S. 2011. Extending Decidable Existential Rules by Joining Acyclicity and Guardedness. In IJCAI, 963-968.
16. Krötzsch, M.; Rudolph, S.; and Hitzler, P. 2007. Complexity Boundaries for Horn Description Logics. In AAAI, 452-457. AAAI Press.
17. Lutz, C.; Toman, D.; and Wolter, F. 2009. Conjunctive Query Answering in the Description Logic EL Using a Relational Database System. In IJCAI, 2070-2075.
18. Motik, B.; Shearer, R.; and Horrocks, I. 2009. Hypertableau reasoning for description logics. JAIR 36:165-228.
19. Ortiz, M.; Rudolph, S.; and Scimkus, M. 2011. Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ. In IJCAI, 1039-1044.
20. Robertson, N., and Seymour, P. D. 1984. Graph Minors. III. Planar Tree-Width. J. Comb. Theory, Ser. B 36(1):49-64.
21. Thomazo, M.; Mugnier, M.-L.; Baget, J.-F.; and Rudolph, S. 2012. A Generic Querying Algorithm for Greedy Sets of Existential Rules. Research Report, LIRMM.