Sophie Tison

Proceedings of the 27th International Conference on Database Theory, 2024

2019

Oblivious and Semi-Oblivious Boundedness for Existential Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2017

Ontology-Mediated Query Answering for Key-Value Stores.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2014

Static analysis of XML security views and query rewriting.

[BibT_eX]

[DOI]

Inf. Comput., 2014

2011

Queries on Xml streams with bounded delay and concurrency.

[BibT_eX]

[DOI]

Olivier Gauwin

Inf. Comput., 2011

Tree Automata, (Dis-)Equality Constraints and Term Rewriting - What's New?

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

View update translation for XML.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2011

2010

Tree Automata with Global Constraints.

[BibT_eX]

[DOI]

Emmanuel Filiot

Int. J. Found. Comput. Sci., 2010

2009

Bounded Delay and Concurrency for Earliest Query Answering.

[BibT_eX]

[DOI]

Olivier Gauwin

Proceedings of the Language and Automata Theory and Applications, 2009

Earliest Query Answering for Deterministic Nested Word Automata.

[BibT_eX]

[DOI]

Olivier Gauwin

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

XML Security Views Revisited.

[BibT_eX]

[DOI]

Proceedings of the Database Programming Languages, 2009

2008

Complexity of Earliest Query Answering with Streaming Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the PLAN-X 2008, 2008

Regular n-ary Queries in Trees and Variable Independence.

[BibT_eX]

[DOI]

Emmanuel Filiot

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Classes of Tree Homomorphisms with Decidable Preservation of Regularity.

[BibT_eX]

[DOI]

Guillem Godoy

Sebastian Maneth

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007

Path constraints in semistructured data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Polynomial time fragments of XPath with variables.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Satisfiability of a Spatial Logic with Tree Variables.

[BibT_eX]

[DOI]

Emmanuel Filiot

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

On the Normalization and Unique Normalization Properties of Term Rewrite Systems.

[BibT_eX]

[DOI]

Guillem Godoy

Proceedings of the Automated Deduction, 2007

2006

Composing Monadic Queries in Trees.

[BibT_eX]

Proceedings of the PLAN-X 2006 Informal Proceedings, 2006

2005

Monotone AC-Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2005

Expressiveness of a Spatial Logic for Trees.

[BibT_eX]

[DOI]

Iovka Boneva

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

N-ary Queries by Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005

2004

Extraction and Implication of Path Constraints.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

BHDL: Circuit Design in B.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

2002

Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

Grid structures and undecidable constraint theories.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

2000

On rewrite constraints and context unification.

[BibT_eX]

[DOI]

Ralf Treinen

Inf. Process. Lett., 2000

Generalized Definite Set Constraints.

[BibT_eX]

[DOI]

Constraints An Int. J., 2000

Tree Automata and Term Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

1999

Set Constraints and Automata.

[BibT_eX]

[DOI]

Inf. Comput., 1999

Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

The Recognizability Problem for Tree Automata with Comparisons between Brothers.

[BibT_eX]

[DOI]

Bruno Bogaert

Franck Seynhaeve

Proceedings of the Foundations of Software Science and Computation Structure, 1999

Homomorphisms and Concurrent Term Rewriting.

[BibT_eX]

[DOI]

Franck Seynhaeve

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

Co-definite Set Constraints with Membership Expressions.

[BibT_eX]

Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997

Set-Based Analysis for Logic Programming and Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 4th International Symposium, 1997

Solving Classes of Set Constraints with Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1995

Regular Tree Languages and Rewrite Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1995

1994

Some new Decidability Results on Positive and Negative Set Constraints.

[BibT_eX]

[DOI]

Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1993

Solving Systems of Set Constraints using Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

Solving Systems of Set Constraints with Negated Subset Relationships

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Equality and Disequality Constraints on Direct Subterms in Tree Automata.

[BibT_eX]

[DOI]

Bruno Bogaert

Proceedings of the STACS 92, 1992

Structural complexity of classes of tree languages.

[BibT_eX]

Proceedings of the Tree Automata and Languages., 1992

1990

Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems

[BibT_eX]

[DOI]

Inf. Comput., October, 1990

The Theory of Ground Rewrite Systems is Decidable

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989

Fair Termination is Decidable for Ground Systems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

About Connections Between Syntactical and Computational Complexity.

[BibT_eX]

[DOI]

Jean-Luc Coquidé

Proceedings of the Fundamentals of Computation Theory, 1989

1987

Decidability of the Confluence of Ground Term Rewriting Systems

[BibT_eX]

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1985

Decidability of confluence for ground term rewriting systems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1983

Metrical an Ordered Properties of Powerdomains.

[BibT_eX]

[DOI]