,
Provenance Circuits for Trees and Treelike Instances (Extended Version), 2015. ,
Querying Schemas with Access Paths, PVLDB, 2012. ,
Analysis of Schemas with Access Restrictions, ACM Trans. Database Syst, vol.40, p.5, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01211288
Monadic Datalog Containment, ICALP, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00809306
Determining relevance of accesses at runtime, PODS, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00591793
The Complexity of Boundedness for Guarded Logics, LICS, 2015. ,
Optimizing Conjunctive Queries over Trees Using Schema Information, MFCS, 2008. ,
Validity of tree pattern queries with respect to schema information, MFCS, 2013. ,
Conjunctive query containment over trees using schema information, Acta Informatica, 2016. ,
On the decidability of containment of recursive datalog queries, PODS, 2004. ,
Containment of Conjunctive Queries under Access Limitations, SEBD, 2006. ,
Conjunctive Query Containment under Access Limitations, 2008. ,
Decidable containment of recursive queries, Theoretical Computer Science, vol.336, p.1, 2005. ,
Containment of Conjunctive Regular Path Queries with Inverse, KR, 2000. ,
, Alternation. J. ACM, vol.28, p.1, 1981.
On the Equivalence of Recursive and Nonrecursive Datalog Programs, PODS, 1992. ,
On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs, PODS, 1994. ,
On the Equivalence of Recursive and Nonrecursive Datalog Programs, JCSS, vol.54, p.1, 1997. ,
Domino-Tiling Games, J. Comput. Syst. Sci, vol.32, issue.86, p.90036, 1986. ,
, Tree Automata Techniques and Applications. Available at, 2002.
Decidable Optimization Problems for Database Logic Programs, STOC, 1988. ,
Recursive queries and context-free graph grammars, Theoretical Computer Science, vol.78, p.1, 1991. ,
Recursive Plans for Information Gathering, IJCAI, 1997. ,
Tree Languages, Handbook of Formal Languages, vol.3, pp.1-68, 1997. ,
Answering Queries with Useful Bindings, TODS, vol.26, pp.313-343, 2001. ,
Query containment for data integration systems, J. Comput. System Sci, vol.66, pp.20-39, 2003. ,
Automata Theory for XML Researchers, SIGMOD Record, vol.31, pp.39-46, 2002. ,
Answering Queries Using Templates with Binding Patterns, PODS, 1995. ,
Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, vol.7, p.3, 1986. ,
Equivalence of datalog queries is undecidable, J. Log. Program, vol.15, issue.93, p.90040, 1993. ,
Generalizations of Regular Sets and Their Application to a Study of Context-Free Languages, Information and Control, vol.27, pp.1-36, 1975. ,
Unary negation, STACS, 2011. ,