Terminological Cycles in a Description Logic with Existential Restrictions, IJCAI'03, pp.325-330, 2003. ,
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
The implication problem for data dependencies, ICALP'81, pp.73-85, 1981. ,
DOI : 10.1007/3-540-10843-2_7
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints, KR'08, pp.70-80, 2008. ,
A General Datalog-Based Framework for Tractable Query Answering over Ontologies, PODS'09, pp.77-86, 2009. ,
Towards more expressive ontology languages: The query answering problem, Artif. Intell, vol.193, pp.87-128, 2012. ,
DL-Lite: Tractable Description Logics for Ontologies, AAAI, pp.602-607, 2005. ,
Alexandros Chortaras, Despoina Trivela, and Giorgos B. Stamou. Optimized Query Rewriting for OWL 2 QL, CADE'11, pp.192-206, 2011. ,
A Broad Class of First-Order Rewritable Tuple-Generating Dependencies, Datalog 2.0 Worksop MASTRO STUDIO: Managing Ontology-Based Data Access applications. PVLDB, pp.68-801314, 2012. ,
DOI : 10.1007/978-3-642-32925-8_8
Query Rewriting for Horn-SHIQ Plus Rules, AAAI, 2012. ,
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs, 2012. ,
Ontological queries: Rewriting and optimization, 2011 IEEE 27th International Conference on Data Engineering, pp.2-13, 2011. ,
DOI : 10.1109/ICDE.2011.5767965
Benchmarking Ontology-Based Query Rewriting Systems Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies, AAAI RR, 2011. [Kikot et al., 2012] S. Kikot, R. Kontchakov, and M. Zakharyaschev . Conjunctive Query Answering with OWL 2 QL. In KR, 2011. ,
A Sound and Complete Backward Chaining Algorithm for Existential Rules On the Exploration of the Query Rewriting Space with Existential Rules The Combined Approach to Ontology-Based Data Access, RR'12 RR IJCAI, 2011. [Krötzsch and Rudolph, 2011] M. Krötzsch and S. Rudolph. Extending Decidable Existential Rules by Joining Acyclicity and Guardedness. In IJCAI'11, pp.122-138, 2011. ,
The Combined Approach to OBDA: Taming Role Hierarchies Using Filters, ISWC'2013, pp.314-330, 2013. ,
DOI : 10.1007/978-3-642-41335-3_20
Efficient Query Answering for OWL 2, ISWC'09 Calvanese. High Performance Query Answering over DL-Lite Ontologies KR, 2012. [Rodriguez-Muro et al., 2013] M. Rodriguez-Muro, pp.489-504, 2009. ,
DOI : 10.1007/978-3-642-04930-9_31
Ontology-Based Data Access: Ontop of Databases, ISWC, Proceedings, Part I, pp.558-573, 2013. ,
Improving Query Answering over DL-Lite Ontologies, KR'10, 2010. ,
Small Datalog Query Rewritings for EL, DL, 2012. [Thomazo and Rudolph, 2014] M. Thomazo and S. Rudolph. Mixing Materialization and Query Rewriting for Existential Rules. In ECAI, pp.897-902, 2012. ,
A Generic Querying Algorithm for Greedy Sets of Existential Rules, 2012. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00675560
Despoina Trivela, Giorgos Stoilos, Alexandros Chortaras, and Giorgos B. Stamou. Optimising Resolution- Based Rewriting Algorithms for DL Ontologies, DL'13, pp.464-476, 2013. ,
NYAYA: A System Supporting the Uniform Management of Large Sets of Semantic Data, 2012 IEEE 28th International Conference on Data Engineering, pp.1309-1312, 2012. ,
DOI : 10.1109/ICDE.2012.133