Extending SPARQL with regular expression patterns (for querying RDF), Web Semantics: Science, Services and Agents on the World Wide Web, vol.7, issue.2, pp.57-73, 2009. ,
DOI : 10.1016/j.websem.2009.02.002
URL : https://hal.archives-ouvertes.fr/lirmm-00410132
The Expressive Power of SPARQL. The Semantic Web-ISWC, pp.114-129, 2008. ,
The DL-Lite Family and Relations, J. of Artificial Intelligence Research, vol.36, pp.1-69, 2009. ,
The Description Logic Handbook: Theory, Implementation, and Applications, 2007. ,
DOI : 10.1017/CBO9780511711787
The Complexity of Enriched µ-calculi, Automata, Languages and Programming, pp.540-551, 2006. ,
Conjunctive query containment and answering under description logic constraints, ACM Transactions on Computational Logic, vol.9, issue.3, pp.22-23, 2008. ,
DOI : 10.1145/1352582.1352590
URL : http://arxiv.org/pdf/cs/0507067v1.pdf
Answering Recursive Queries under Keys and Foreign Keys is Undecidable, Proc. of the 10th Int. Workshop on Knowledge Representation meets Databases, pp.3-14, 2003. ,
Optimal Implementation of Conjunctive Queries in Relational Data Bases, Proceedings of the ninth annual ACM symposium on Theory of computing, pp.77-90, 1977. ,
Semantics preserving sparql-to-sql query translation for optional graph patterns, 2006. ,
PSPARQL query containment, Research report, vol.7641, 2011. ,
PSPARQL query containment [13] R. Cyganiak. A relational algebra for SPARQL, 2005. ,
Logical foundations of RDF (S) with datatypes, J. of Artificial Intelligence Research, vol.38, issue.1, pp.535-568, 2010. ,
Query answering in description logics with transitive roles, Proc. of IJCAI, pp.759-764, 2009. ,
Efficient Static Analysis of XML Paths and Types, PLDI '07, pp.342-351, 2007. ,
Conjunctive query answering for the description logic shiq, J Artif Intell Res, vol.31, pp.157-204, 2008. ,
Practical Reasoning for Expressive Description Logics, Logic for Programming and Automated Reasoning, pp.161-180, 1999. ,
DOI : 10.1007/3-540-48242-3_11
Containment of conjunctive queries: beyond relations as sets, ACM Transactions on Database Systems, vol.20, issue.3, pp.288-324, 1995. ,
DOI : 10.1145/211414.211419
Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies, J. Comput. Syst. Sci, vol.28, issue.1, pp.167-189, 1984. ,
SPARQL Query Answering over OWL Ontologies, Proc. 8th ESWC, pp.382-396, 2011. ,
DOI : 10.1016/j.websem.2005.06.005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.1034
Results on the Propositional ??-Calculus, DAIMI Report Series, vol.11, issue.146, pp.333-354, 1983. ,
DOI : 10.7146/dpb.v11i146.7420
The complexity of conjunctive query answering in expressive description logics. Automated Reasoning, pp.179-193, 2008. ,
Minimal Deductive Systems for RDF, LNCS, vol.4519, pp.53-67, 2007. ,
Semantics and complexity of SPARQL, ACM Transactions on Database Systems (TODS), vol.34, issue.3, p.16, 2009. ,
From SPARQL to rules (and back), Proceedings of the 16th international conference on World Wide Web , WWW '07, pp.787-796, 2007. ,
DOI : 10.1145/1242572.1242679
SPARQL Query Language for RDF, W3C Rec, 2008. ,
The Hybrid µ-Calculus, IJCAR, pp.76-91, 2001. ,
Foundations of SPARQL query optimization, Proceedings of the 13th International Conference on Database Theory, ICDT '10, pp.4-33, 2010. ,
DOI : 10.1145/1804669.1804675
A Decision Procedure for Alternation-Free Modal µ-calculi, Advances in Modal Logic, pp.341-362, 2008. ,
A Decision Procedure for the Alternation-Free Two-Way Modal ??-Calculus, TABLEAUX, pp.277-291, 2005. ,
DOI : 10.1007/11554554_21