Sophie Tison - RankMe

60 papers A* 7A 8B 11C 2Journal 13Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Corrections to "On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164-194]". J. Comput. Syst. Sci. Pablo Barceló, Gaëlle Fontaine, Sylvain Salvati, Sophie Tison
2024	A	`conf`	Containment of Regular Path Queries Under Path Constraints. ICDT Sylvain Salvati, Sophie Tison
2020	J	`jnl`	Oblivious and Semi-Oblivious Boundedness for Existential Rules. CoRR Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois
2020	—	`ch.`	Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research (3) (III) Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison
2020	—	`ch.`	Theoretical Computer Science: Computational Complexity. A Guided Tour of Artificial Intelligence Research (3) (III) Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison
2019	A*	`conf`	Oblivious and Semi-Oblivious Boundedness for Existential Rules. IJCAI Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois
2017	A*	`conf`	Ontology-Mediated Query Answering for Key-Value Stores. IJCAI Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana
2014	J	`jnl`	Static analysis of XML security views and query rewriting. Inf. Comput. Benoît Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison
2011	J	`jnl`	Queries on Xml streams with bounded delay and concurrency. Inf. Comput. Olivier Gauwin, Joachim Niehren, Sophie Tison
2011	—	`conf`	Tree Automata, (Dis-)Equality Constraints and Term Rewriting - What's New? TLCA Sophie Tison
2011	—	`conf`	Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?. RTA Sophie Tison
2011	A	`conf`	View update translation for XML. ICDT Iovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawek Staworko
2010	J	`jnl`	Tree Automata with Global Constraints. Int. J. Found. Comput. Sci. Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
2009	C	`conf`	Bounded Delay and Concurrency for Earliest Query Answering. LATA Olivier Gauwin, Joachim Niehren, Sophie Tison
2009	B	`conf`	Earliest Query Answering for Deterministic Nested Word Automata. FCT Olivier Gauwin, Joachim Niehren, Sophie Tison
2009	—	`conf`	XML Security Views Revisited. DBPL Benoît Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison
2008	B	`conf`	Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FoSSaCS Guillem Godoy, Sebastian Maneth, Sophie Tison
2008	—	`conf`	Complexity of Earliest Query Answering with Streaming Tree Automata. PLAN-X Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison
2008	—	`conf`	Regular n-ary Queries in Trees and Variable Independence. IFIP TCS Emmanuel Filiot, Sophie Tison
2008	C	`conf`	Tree Automata with Global Constraints. Developments in Language Theory Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
2007	A	`conf`	On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE Guillem Godoy, Sophie Tison
2007	J	`jnl`	Path constraints in semistructured data. Theor. Comput. Sci. Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
2007	A*	`conf`	Polynomial time fragments of XPath with variables. PODS Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
2007	B	`conf`	Satisfiability of a Spatial Logic with Tree Variables. CSL Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
2006	—	`conf`	Composing Monadic Queries in Trees. PLAN-X Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
2005	A*	`conf`	Expressiveness of a Spatial Logic for Trees. LICS Iovka Boneva, Jean-Marc Talbot, Sophie Tison
2005	B	`conf`	Monotone AC-Tree Automata. LPAR Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos
2005	—	`conf`	N-Ary Queries by Tree Automata. DBPL Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
2005	—	`conf`	N-ary Queries by Tree Automata. Foundations of Semistructured Data Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
2004	B	`conf`	Extraction and Implication of Path Constraints. MFCS Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
2003	—	`conf`	BHDL: Circuit Design in B. ACSD Ammar Aljer, Philippe Devienne, Sophie Tison, Jean-Louis Boulanger, Georges Mariano
2002	J	`jnl`	Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. Theor. Comput. Sci. Max Dauchet, Sophie Tison, Marc Tommasi
2002	—	`ed.`	Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings RTA Sophie Tison
2001	J	`jnl`	Grid structures and undecidable constraint theories. Theor. Comput. Sci. Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen
2000	J	`jnl`	Generalized Definite Set Constraints. Constraints An Int. J. Jean-Marc Talbot, Philippe Devienne, Sophie Tison
2000	J	`jnl`	On rewrite constraints and context unification. Inf. Process. Lett. Joachim Niehren, Sophie Tison, Ralf Treinen
2000	A	`ed.`	STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings STACS Horst Reichel, Sophie Tison
2000	—	`conf`	Tree Automata and Term Rewrite Systems. RTA Sophie Tison
1999	—	`conf`	Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. RTA Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi
1999	B	`conf`	Homomorphisms and Concurrent Term Rewriting. FCT Franck Seynhaeve, Sophie Tison, Marc Tommasi
1999	A	`ed.`	STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings STACS Christoph Meinel, Sophie Tison
1999	J	`jnl`	Set Constraints and Automata. Inf. Comput. Rémi Gilleron, Sophie Tison, Marc Tommasi
1999	B	`conf`	The Recognizability Problem for Tree Automata with Comparisons between Brothers. FoSSaCS Bruno Bogaert, Franck Seynhaeve, Sophie Tison
1998	—	`conf`	Co-definite Set Constraints with Membership Expressions. IJCSLP Philippe Devienne, Jean-Marc Talbot, Sophie Tison
1997	B	`conf`	Set-Based Analysis for Logic Programming and Tree Automata. SAS Jean-Marc Talbot, Sophie Tison, Philippe Devienne
1997	A	`conf`	Solving Classes of Set Constraints with Tree Automata. CP Philippe Devienne, Jean-Marc Talbot, Sophie Tison
1995	J	`jnl`	Regular Tree Languages and Rewrite Systems. Fundam. Informaticae Rémi Gilleron, Sophie Tison
1994	—	`conf`	Some new Decidability Results on Positive and Negative Set Constraints. CCL Rémi Gilleron, Sophie Tison, Marc Tommasi
1994	—	`ed.`	Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, UK, April 11-13, 1994, Proceedings CAAP Sophie Tison
1993	A	`conf`	Solving Systems of Set Constraints using Tree Automata. STACS Rémi Gilleron, Sophie Tison, Marc Tommasi
1993	A*	`conf`	Solving Systems of Set Constraints with Negated Subset Relationships FOCS Rémi Gilleron, Sophie Tison, Marc Tommasi
1992	A	`conf`	Equality and Disequality Constraints on Direct Subterms in Tree Automata. STACS Bruno Bogaert, Sophie Tison
1992	—	`ch.`	Structural complexity of classes of tree languages. Tree Automata and Languages Max Dauchet, Sophie Tison
1990	J	`jnl`	Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems Inf. Comput. Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison
1990	A*	`conf`	The Theory of Ground Rewrite Systems is Decidable LICS Max Dauchet, Sophie Tison
1989	B	`conf`	About Connections Between Syntactical and Computational Complexity. FCT Jean-Luc Coquidé, Max Dauchet, Sophie Tison
1989	—	`conf`	Fair Termination is Decidable for Ground Systems. RTA Sophie Tison
1987	A*	`conf`	Decidability of the Confluence of Ground Term Rewriting Systems LICS Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne
1985	B	`conf`	Decidability of confluence for ground term rewriting systems. FCT Max Dauchet, Sophie Tison
1983	B	`conf`	Metrical an Ordered Properties of Powerdomains. FCT Sophie Tison, Max Dauchet, Gérard Comyn