Extending decidable cases for rules with existential variables, IJCAI'09, pp.677-682, 2009. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00410130
On rules with existential variables: Walking the decidability line, Artificial Intelligence, vol.175, issue.9-10, pp.9-101620, 2011. ,
DOI : 10.1016/j.artint.2011.03.002
URL : https://hal.archives-ouvertes.fr/lirmm-00587012
Taming the infinite chase: Query answering under expressive relational constraints, KR'08, pp.70-80, 2008. ,
Tractable reasoning and efficient query answering in description logics: The DL-Lite family, J. Autom. Reasoning, vol.39, issue.3, pp.385-429, 2007. ,
A general datalog-based framework for tractable query answering over ontologies, PODS'09, pp.77-86, 2009. ,
Query answering under non-guarded rules in datalog+, RR'10, pp.1-17, 2010. ,
Ontological queries: Rewriting and optimization Benchmarking ontology-based query rewriting systems, ICDE'11 ISG12. Martha Imprialou, Giorgos Stoilos, AAAI, pp.2-13, 2011. ,
A Sound and Complete Backward Chaining Algorithm for Existential Rules, Lecture Notes in Computer Science, vol.7497, pp.122-138, 2012. ,
DOI : 10.1007/978-3-642-33203-6_10
On the Exploration of the Query Rewriting Space with Existential Rules, 2013. ,
DOI : 10.1007/978-3-642-39666-3_10
The Combined Approach to Ontology-Based Data Access, IJCAI, pp.2656-2661, 2011. ,
Extending decidable existential rules by joining acyclicity and guardedness, IJCAI'11, pp.963-968, 2011. ,
Conjunctive query answering in the description logic el using a relational database system, IJCAI'09, pp.2070-2075, 2009. ,
Efficient query answering for owl 2 Improving query answering over DL-Lite ontologies, ISWC'09 KR'10, pp.489-504, 2009. ,
High performance query answering over DLlite ontologies Sound and Complete Forward and Backward Chainings of Graph Rules Compact rewriting for existential rules, KR, 2012. SM96. E. Salvat and M.-L. Mugnier ICCS'96, volume 1115 of LNAI Tho13. M. Thomazo IJCAI, 2013. VSS12. T. Venetis, G. Stoilos, and G. B. Stamou. Incremental query rewriting for OWL 2 QL. In Description Logics, pp.248-262, 1996. ,