. Alkhateeb, 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

]. R. Angles and C. Gutierrez, The Expressive Power of SPARQL. The Semantic Web-ISWC, pp.114-129, 2008.

&. Baader, W. Baader, and . Nutt, The description logic handbook, pp.43-95, 2003.
DOI : 10.1017/CBO9780511711787

. Baader, The description logic handbook: Theory, implementation , and applications, p.107, 2007.
DOI : 10.1017/CBO9780511711787

]. J. Baget, RDF Entailment as a Graph Homomorphism. The Semantic Web?ISWC, pp.82-96, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00922476

P. Barceló, C. Hurtado, L. Libkin, and P. Wood, Expressive languages for path queries over graph-structured data, PODS'10, pp.3-14

. Barcenas, Query reasoning on trees with types, interleaving and counting, IJCAI'11 : Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.718-723, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00609556

&. Barton, . Odvarko, J. John, J. Barton, and . Odvarko, Dynamic and graphical web page breakpoints, Proceedings of the 19th international conference on World wide web, WWW '10, pp.81-90, 2010.
DOI : 10.1145/1772690.1772700

M. Benedikt and J. Cheney, Destabilizers and independence of XML updates, Proceedings of the VLDB Endowment, pp.906-917, 2010.
DOI : 10.14778/1920841.1920956

. Benedikt, Michael Benedikt, Wenfei Fan and Floris Geerts XPath satisfiability in the presence of DTDs, PODS '05, pp.25-36, 2005.

. Beyer, DB2/XML, Proceedings of the 2005 ACM SIGMOD international conference on Management of data , SIGMOD '05, pp.948-952, 2005.
DOI : 10.1145/1066157.1066299

. Bierman, Semantic subtyping with an SMT solver, Proceedings of the 15th international conference on functional programming (ICFP '10), pp.105-116, 2010.
DOI : 10.1145/1932681.1863560

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.2428

&. Bizer, ]. C. Schultz, A. Bizer, and . Schultz, Benchmarking the performance of storage systems that expose SPARQL endpoints, Proc. 4 th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS), 2008.

&. Bizer, ]. C. Schultz, A. Bizer, and . Schultz, The Berlin SPARQL benchmark, International Journal on Semantic Web and Information Systems (IJSWIS), vol.5, issue.2, pp.1-24, 2009.

. Blackburn, Handbook of Modal Logic, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00580143

. Boag, XQuery 1.0: An XML Query Language, W3C Recommendation, 2007.

&. Bonatti, ]. P. Peron, A. Bonatti, and . Peron, On the undecidability of logics with converse, nominals, recursion and counting, Artificial Intelligence, vol.158, issue.1, pp.75-96, 2004.
DOI : 10.1016/j.artint.2004.04.012

. Bonatti, The Complexity of Enriched µ-calculi. Automata, Languages and Programming, pp.540-551, 2006.

. Bos, Cascading Style Sheets Level 2 Revision 1 (CSS 2.1) Specification. W3C recommendation, World Wide Web Consortium, p.78, 2011.

. Bosch, Automated refactoring for size reduction of CSS style sheets, Proceedings of the 2014 ACM symposium on Document engineering, DocEng '14, p.2014
DOI : 10.1145/2644866.2644885

URL : https://hal.archives-ouvertes.fr/hal-01081876

E. Randal and . Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Trans. on Computers, vol.35, issue.8, pp.677-691, 1986.

&. Calvanese, ]. D. Rosati, R. Calvanese, and . Rosati, 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.

. Calvanese, On the decidability of query containment under constraints, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '98, pp.149-158, 1998.
DOI : 10.1145/275487.275504

. Calvanese, Containment of Conjunctive Regular Path Queries with Inverse, Proc. of the 7th Int. Conf. on the Principles of Knowledge Representation and Reasoning, pp.176-185, 2000.

. Calvanese, Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family, Journal of Automated Reasoning, vol.104, issue.1,2, pp.385-429, 2007.
DOI : 10.1007/s10817-007-9078-x

. Calvanese, Containment of Regular Path Queries under Description Logic Constraints, Proc. of the 22nd Int, 2011.

G. Castagna and K. Nguyen, Typed iterators for XML, ICFP '08: Proceedings of the ACM SIGPLAN international conference on Functional programming, pp.15-26, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00336119

]. G. Castagna and Z. Xu, Set-theoretic Foundation of Parametric Polymorphism and Subtyping, Proceedings of the 16th international conference on functional programming (ICFP '11), pp.45-58, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00618839

]. A. Chandra and P. M. Merlin, Optimal implementation of conjunctive queries in relational data bases, Proceedings of the ninth annual ACM symposium on Theory of computing , STOC '77, pp.77-90, 1977.
DOI : 10.1145/800105.803397

A. Chebotko, S. Lu, H. M. Jamil, and F. Fotouhi, Semantics preserving SPARQL-to-SQL query translation for optional graph patterns. Rapport technique, 2006.

M. W. Chekol, J. Euzenat, P. Genevès, and N. Laya¨?dalaya¨?da, PSPARQL Query Containment, DBPL'11, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00598819

. Chekol, SPARQL Query Containment under RDFS Entailment Regime, IJCAR'12, pp.134-148
DOI : 10.1007/978-3-642-31365-3_13

URL : https://hal.archives-ouvertes.fr/hal-00691610

. Chekol, SPARQL Query Containment under SHI Axioms, AAAI'12, pp.10-16
DOI : 10.1007/978-3-642-31365-3_13

URL : https://hal.archives-ouvertes.fr/hal-00691638

&. Chekuri, . Rajaraman-1997-]-c, A. Chekuri, and . Rajaraman, Conjunctive query containment revisited, Database Theory?ICDT'97, pp.56-70, 1997.
DOI : 10.1016/s0304-3975(99)00220-0

URL : http://doi.org/10.1016/s0304-3975(99)00220-0

&. Clark, S. Clark, and . Derose, XML Path Language (XPath) Version 1.0, W3C Recommendation, pp.16-45, 1999.

G. Ghelli, P. Manghi, and C. Sartiani, Types for path correctness of XML queries, ICFP '04: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, pp.126-137, 2004.

. Colazzo, Static analysis for path correctness of XML queries, Journal of Functional Programming, vol.16, issue.4&5, pp.621-661, 2006.
DOI : 10.1017/S0956796806005983

]. R. Cyganiak, A relational algebra for SPARQL. Digital Media Systems Laboratory HP Laboratories Bristol, 2005.

&. De-moura, N. Bjørner-moura, and . Bjørner, Z3: An Efficient SMT Solver, Proceedings of the 14th international conference on tools and algorithms for the construction and analysis of systems (TACAS '08), pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

K. James-eberlein, R. D. Anderson, and G. Joseph, Darwin Information Typing Architecture (DITA) Version 1.2. Oasis standard, OASIS, 2010.

E. M. Clarke, Orna Grumberg and Doron A. Peled. Model checking, 1999.

. Eiter, Query answering in description logics with transitive roles, Proc. of IJCAI, pp.759-764, 2009.

D. Engovatov and J. Robie, XQuery 3.0 Requirements , W3C Working Draft, 2010.

. Frisch, Semantic subtyping, Journal of the ACM, vol.55, issue.4, pp.1-64, 2008.
DOI : 10.1145/1391289.1391293

URL : https://hal.archives-ouvertes.fr/hal-00152690

. Gapeyev, Statically Typed Document Transformation: An Xtatic Experience, PLAN-X 2006: Proceedings of the International Workshop on Programming Language Technologies for XML, volume NS-05-6 of BRICS Notes Series, pp.2-13, 2006.

&. Genevès and . Laya¨?dalaya¨?da, A system for the static analysis of XPath, ACM Transactions on Information Systems, vol.24, issue.4, pp.475-502, 2006.
DOI : 10.1145/1185877.1185882

&. Genevès and . Laya¨?dalaya¨?da, Pierre Genevès and Nabil Laya¨?daLaya¨?da Eliminating dead-code from XQuery programs, Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering, pp.305-306, 2010.

&. Genevès and . Laya¨?dalaya¨?da, Pierre Genevès and Nabil Laya¨?daLaya¨?da Inconsistent path detection for XML IDEs, Proceeding of the 33rd international conference on Software engineering, ICSE '11, pp.983-985, 2011.

&. Genevès, P. Laya¨?dalaya¨?da, N. Genevès, and . Laya¨?dalaya¨?da, Equipping IDEs with XML-Path Reasoning Capabilities, ACM Transactions on Internet Technology, vol.13, issue.4, 2014.
DOI : 10.1145/2602573

&. Genevès, P. Laya¨?dalaya¨?da, N. Genevès, and . Laya¨?dalaya¨?da, The XML Reasoning Solver Project, pp.14-16, 2014.

. Genevès, Efficient Static Analysis of XML Paths and Types, Proceedings of the 28th conference on programming language design and implementation (PLDI '07), pp.342-351, 2007.

P. Genevès, N. Laya¨?dalaya¨?da, and V. Quint, Identifying query incompatibilities with evolving XML schemas, ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming, pp.221-230, 2009.

. Genevès, Impact of XML Schema Evolution, ACM Transactions on Internet Technology, vol.11, issue.1, pp.1-4, 2011.
DOI : 10.1145/1993083.1993087

. Genevès, On the analysis of cascading style sheets, Proceedings of the 21st international conference on World Wide Web, WWW '12, pp.809-818, 2012.
DOI : 10.1145/2187836.2187946

. Gesbert, Parametric Polymorphism and Semantic Subtyping: the Logical Connection, Pierre Genevès and Nabil Laya¨?daLaya¨?da ICFP '11: Proceedings of the 16th ACM SIGPLAN international conference on Functional programming, pp.107-116, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00585686

. Glimm, Conjunctive query answering for the description logic SHIQ, J Artif Intell Res, vol.31, pp.157-204, 2008.

&. Groppe and . Groppe, Filtering unsatisfiable XPath queries, Data & Knowledge Engineering, vol.64, issue.1, pp.134-169, 2008.
DOI : 10.1016/j.datak.2007.06.018

. Groppe, XPath Query Simplification with regard to the Elimination of Intersect and Except Operators, 22nd International Conference on Data Engineering Workshops (ICDEW'06), 2006.
DOI : 10.1109/ICDEW.2006.165

. Groppe, Optimization of SPARQL by using coreSPARQL, ICEIS (1), pp.107-112, 2009.

I. Horrocks and P. F. Patel-schneider, Knowledge Representation and Reasoning on the Semantic Web: OWL, 2010.

. Horrocks, The even more irresistible SROIQ, Proc. of KR 2006, pp.57-67, 2006.

&. Hosoya, C. Benjamin, and . Pierce, XDuce, ACM Transactions on Internet Technology, vol.3, issue.2, pp.117-148, 2003.
DOI : 10.1145/767193.767195

. Hosoya, Regular expression types for XML, ACM Transactions on Programming Languages and Systems, vol.27, issue.1, pp.46-90, 2005.
DOI : 10.1145/1053468.1053470

URL : https://hal.archives-ouvertes.fr/hal-00009271

. Hosoya, Parametric polymorphism for XML, ACM Transactions on Programming Languages and Systems, vol.32, issue.1, pp.1-56, 2009.
DOI : 10.1145/1596527.1596529

URL : https://hal.archives-ouvertes.fr/hal-00152609

&. Johnson, ]. D. Klug, A. C. Johnson, and . Klug, Testing containment of conjunctive queries under functional and inclusion dependencies, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems , PODS '82, pp.167-189, 1984.
DOI : 10.1145/588111.588138

&. Keller, M. Keller, and M. Nussbaumer, Cascading style sheets, Proceedings of the 18th international conference on World wide web, WWW '09, pp.1161-1162, 2009.
DOI : 10.1145/1526709.1526907

&. Keller, M. Nussbaumer, M. Keller, and . Nussbaumer, CSS Code Quality: A Metric for Abstractness, Seventh International Conference on the Quality of Information and Communications Technology (QUATIC), pp.116-121, 2010.

. Kollia, 2011] I. Kollia, B. Glimm and I. Horrocks. SPARQL Query Answering over OWL Ontologies, Proc. 8th ESWC, pp.382-396, 2011.

. Kupferman, The complexity of the graded µ-calculus. Automated Deduction?CADE-18, pp.173-206, 2002.

. Letelier, Static analysis and optimization of semantic web queries, PODS'12, pp.89-100, 2012.

. Lutz, Conjunctive Query Answering in the Description Logic EL Using a Relational Database System, IJCAI, pp.2070-2075, 2009.

]. C. Lutz, The complexity of conjunctive query answering in expressive description logics. Automated Reasoning, pp.179-193, 2008.

&. Marden, M. Philip, E. V. Marden, and . Munson, Today's style sheet standards: the great vision blinded, Computer, vol.32, issue.11, pp.123-125, 1999.
DOI : 10.1109/2.803645

. Mateescu, Extending SPARQL with Temporal Logic, INRIA Research Report, issue.7056, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00404761

&. Møller and . Schwartzbach, Anders Møller and Michael I. Schwartzbach. The Design Space of Type Checkers for XML Transformation Languages, Proc. Tenth International Conference on Database Theory, ICDT '05, pp.17-36, 2005.

. Moon, Managing and querying transaction-time databases under schema evolution, VLDB '08: Proceedings of the 34nd international conference on Very large data bases, pp.882-895, 2008.
DOI : 10.14778/1453856.1453952

. Moro, Preserving XML queries during schema evolution, Proceedings of the 16th international conference on World Wide Web , WWW '07, pp.1341-1342, 2007.
DOI : 10.1145/1242572.1242841

. Muñoz, Minimal Deductive Systems for RDF, LNCS, vol.4519, pp.53-67, 2007.

. Murata, Taxonomy of XML schema languages using formal language theory, ACM Transactions on Internet Technology, vol.5, issue.4, pp.660-704, 2005.
DOI : 10.1145/1111627.1111631

. Ortiz, Data Complexity of Query Answering in Expressive Description Logics via Tableaux, Journal of Automated Reasoning, vol.12, issue.2, pp.61-98, 2008.
DOI : 10.1007/s10817-008-9102-9

. Ortiz, Worst-case optimal conjunctive query answering for an expressive description logic without inverses, Proc. of AAAI, 2008.

. Pan, BDD-based decision procedures for the modal logic K ???, Journal of Applied Non-Classical Logics, vol.2, issue.2, pp.169-208, 2006.
DOI : 10.1016/0004-3702(92)90049-4

. Pérez, Semantics and complexity of SPARQL, ACM Transactions on Database Systems (TODS), vol.34, issue.114, pp.16-111, 2009.

. Pérez, Semantics of SPARQL. Unpublished Manuscript, 2009.

. Pichler, Redundancy elimination on rdf graphs in the presence of rules, constraints, and queries. Web Reasoning and Rule Systems, pp.133-148, 2010.

]. A. Polleres, How (well) do Datalog, SPARQL and RIF interplay? Datalog in Academia and Industry, pp.27-30, 2012.

E. Prud-'hommeaux and A. Seaborne, SPARQL Query Language for RDF, W3C Rec, vol.114, p.111, 2008.

&. Quint and . Vatton, Vincent Quint and Irène Vatton Editing with style, Proceedings of the 2007 ACM symposium on Document engineering, DocEng '07, pp.151-160, 2007.
DOI : 10.1145/1284420.1284460

&. Sattler, M. Y. Sattler, and . Vardi, The Hybrid µ-Calculus, IJCAR, pp.76-91, 2001.

T. Hornung, G. Lausen, and C. Pinkel, SP?2BenchSP?2Bench: A SPARQL Performance Benchmark, ICDE'09, pp.222-233, 2009.

M. Meier and G. Lausen, Foundations of SPARQL Query Optimization, ICDT '10, pp.4-33, 2010.

. Serfiotis, Containment and Minimization of RDF/S Query Patterns, The Semantic Web - ISWC 2005, pp.607-623, 2005.
DOI : 10.1007/11574620_44

]. Serrano, HSS, Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, PPDP '10, pp.109-118, 2010.
DOI : 10.1145/1836089.1836104

. Stocker, SPARQL basic graph pattern optimization using selectivity estimation, Proceeding of the 17th international conference on World Wide Web , WWW '08, pp.595-604, 2008.
DOI : 10.1145/1367497.1367578

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.557

. Tanabe, A Decision Procedure for the Alternation-Free Two-Way Modal ??-Calculus, TABLEAUX, pp.277-291, 2005.
DOI : 10.1007/11554554_21

. Tanabe, A Decision Procedure for Alternation-Free Modal µ-calculi, Advances in Modal Logic, pp.341-362, 2008.

]. H. Horst, Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary, Web Semantics: Science, Services and Agents on the World Wide Web, pp.79-115, 2005.
DOI : 10.1016/j.websem.2005.06.001

]. Walsh, Docbook: The definitive guide. O'Reilly & Associates, 1999.

&. Yu, C. Popa, L. Yu, and . Popa, Semantic adaptation of schema mappings when schemas evolve, VLDB '05: Proceedings of the 31st international conference on Very large data bases, pp.1006-1017, 2005.