Sophie Tison

Émérite CNU : SECTION 27 - INFORMATIQUE

UMR 9189 - CENTRE DE RECHERCHE EN INFORMATIQUE, SIGNAL ET AUTOMATIQUE DE LILLE

Publications

{ "response":{ "numFound":55, "start":0, "numFoundExact":true, "docs":[{ "citationRef_s":"27th International Conference on Database Theory (ICDT 2024), Mar 2024, Paestum, Italy. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2024.17\">⟨10.4230/LIPIcs.ICDT.2024.17⟩</a>", "citationFull_s":"Sylvain Salvati, Sophie Tison. Containment of Regular Path Queries Under Path Constraints. 27th International Conference on Database Theory (ICDT 2024), Mar 2024, Paestum, Italy. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.ICDT.2024.17\">⟨10.4230/LIPIcs.ICDT.2024.17⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-04520222v1\">⟨hal-04520222⟩</a>", "title_s":["Containment of Regular Path Queries Under Path Constraints"], "authFullName_s":["Sylvain Salvati","Sophie Tison"], "halId_s":"hal-04520222", "docType_s":"COMM", "producedDateY_i":2024 },{ "citationRef_s":"[Research Report] LIRMM (UM, CNRS). 2020", "citationFull_s":"Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, et al.. Oblivious and Semi-Oblivious Boundedness for Existential Rules. [Research Report] LIRMM (UM, CNRS). 2020. <a target=\"_blank\" href=\"https://hal-lirmm.ccsd.cnrs.fr/lirmm-02920624v1\">⟨lirmm-02920624⟩</a>", "title_s":["Oblivious and Semi-Oblivious Boundedness for Existential Rules"], "authFullName_s":["Pierre Bourhis","Michel Leclère","Marie-Laure Mugnier","Sophie Tison","Federico Ulliana","Lily Galois"], "halId_s":"lirmm-02920624", "docType_s":"REPORT", "producedDateY_i":2020 },{ "citationRef_s":"A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, pp.1-50, 2020, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-030-06170-8_1\">⟨10.1007/978-3-030-06170-8_1⟩</a>", "citationFull_s":"Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, pp.1-50, 2020, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-030-06170-8_1\">⟨10.1007/978-3-030-06170-8_1⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-03173193v1\">⟨hal-03173193⟩</a>", "title_s":["Theoretical Computer Science: Computability, Decidability and Logic"], "authFullName_s":["Olivier Bournez","Gilles Dowek","Rémi Gilleron","Serge Grigorieff","Jean-Yves Marion","Simon Perdrix","S. Tison"], "halId_s":"hal-03173193", "docType_s":"COUV", "producedDateY_i":2020 },{ "citationRef_s":"A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, 2020", "citationFull_s":"Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Theoretical Computer Science: Computational Complexity. A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, 2020. <a target=\"_blank\" href=\"https://hal.science/hal-02995771v1\">⟨hal-02995771⟩</a>", "title_s":["Theoretical Computer Science: Computational Complexity"], "authFullName_s":["Olivier Bournez","Gilles Dowek","Rémi Gilleron","Serge Grigorieff","Jean-Yves Marion","Simon Perdrix","S. Tison"], "halId_s":"hal-02995771", "docType_s":"COUV", "producedDateY_i":2020 },{ "citationRef_s":"IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. pp.1581-1587, <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/ijcai.2019/219\">⟨10.24963/ijcai.2019/219⟩</a>", "citationFull_s":"Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, et al.. Oblivious and Semi-Oblivious Boundedness for Existential Rules. IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. pp.1581-1587, <a target=\"_blank\" href=\"https://dx.doi.org/10.24963/ijcai.2019/219\">⟨10.24963/ijcai.2019/219⟩</a>. <a target=\"_blank\" href=\"https://hal-lirmm.ccsd.cnrs.fr/lirmm-02148142v1\">⟨lirmm-02148142⟩</a>", "title_s":["Oblivious and Semi-Oblivious Boundedness for Existential Rules"], "authFullName_s":["Pierre Bourhis","Michel Leclère","Marie-Laure Mugnier","Sophie Tison","Federico Ulliana","Lily Gallois"], "halId_s":"lirmm-02148142", "docType_s":"COMM", "producedDateY_i":2019 },{ "citationRef_s":"IJCAI: International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia", "citationFull_s":"Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana. Ontology-Mediated Query Answering for Key-Value Stores. IJCAI: International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. <a target=\"_blank\" href=\"https://hal-lirmm.ccsd.cnrs.fr/lirmm-01632090v1\">⟨lirmm-01632090⟩</a>", "title_s":["Ontology-Mediated Query Answering for Key-Value Stores"], "authFullName_s":["Meghyn Bienvenu","Pierre Bourhis","Marie-Laure Mugnier","Sophie Tison","Federico Ulliana"], "halId_s":"lirmm-01632090", "docType_s":"COMM", "producedDateY_i":2017 },{ "citationRef_s":"Information and Computation, 2014, 238, pp.2-29. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2014.07.003\">⟨10.1016/j.ic.2014.07.003⟩</a>", "citationFull_s":"Benoit Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison. Static analysis of xml security views and query rewriting. Information and Computation, 2014, 238, pp.2-29. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2014.07.003\">⟨10.1016/j.ic.2014.07.003⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00796297v1\">⟨hal-00796297⟩</a>", "title_s":["Static analysis of xml security views and query rewriting"], "authFullName_s":["Benoit Groz","Slawomir Staworko","Anne-Cécile Caron","Yves Roos","Sophie Tison"], "halId_s":"hal-00796297", "docType_s":"ART", "producedDateY_i":2014 },{ "citationRef_s":"Tree Transducers and Formal Methods (Dagstuhl Seminar 13192), May 2013, Wadern, Germany. pp.1-18, 2013", "citationFull_s":"Emmanuel Filiot, Florent Jacquemard, Sophie Tison. Tree Automata with Constraints: a brief survey. Tree Transducers and Formal Methods (Dagstuhl Seminar 13192), May 2013, Wadern, Germany. pp.1-18, 2013. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00840959v1\">⟨hal-00840959⟩</a>", "title_s":["Tree Automata with Constraints: a brief survey"], "authFullName_s":["Emmanuel Filiot","Florent Jacquemard","Sophie Tison"], "halId_s":"hal-00840959", "docType_s":"PRESCONF", "producedDateY_i":2013 },{ "citationRef_s":"22nd International Conference on Rewriting Techniques and Applications (RTA'11), Apr 2011, France. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.RTA.2011.1\">⟨10.4230/LIPIcs.RTA.2011.1⟩</a>", "citationFull_s":"Sophie Tison. Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?. 22nd International Conference on Rewriting Techniques and Applications (RTA'11), Apr 2011, France. <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.RTA.2011.1\">⟨10.4230/LIPIcs.RTA.2011.1⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00818127v1\">⟨hal-00818127⟩</a>", "title_s":["Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?"], "authFullName_s":["Sophie Tison"], "halId_s":"hal-00818127", "docType_s":"COMM", "producedDateY_i":2011 },{ "citationRef_s":"14th International Conference on Database Theory (ICDT), Mar 2011, Uppsala, Sweden", "citationFull_s":"Iovka Boneva, Benoit Groz, Sophie Tison, Anne-Cécile Caron, Yves Roos, et al.. View update translation for XML. 14th International Conference on Database Theory (ICDT), Mar 2011, Uppsala, Sweden. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00534857v2\">⟨inria-00534857v2⟩</a>", "title_s":["View update translation for XML"], "authFullName_s":["Iovka Boneva","Benoit Groz","Sophie Tison","Anne-Cécile Caron","Yves Roos","Slawomir Staworko"], "halId_s":"inria-00534857", "docType_s":"COMM", "producedDateY_i":2011 },{ "citationRef_s":"Information and Computation, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2010.08.003\">⟨10.1016/j.ic.2010.08.003⟩</a>", "citationFull_s":"Olivier Gauwin, Joachim Niehren, Sophie Tison. Queries on XML Streams with Bounded Delay and Concurrency. Information and Computation, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2010.08.003\">⟨10.1016/j.ic.2010.08.003⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00491495v1\">⟨inria-00491495⟩</a>", "title_s":["Queries on XML Streams with Bounded Delay and Concurrency"], "authFullName_s":["Olivier Gauwin","Joachim Niehren","Sophie Tison"], "halId_s":"inria-00491495", "docType_s":"ART", "producedDateY_i":2011 },{ "citationRef_s":"International Journal of Foundations of Computer Science, 2010, 21 (4), pp.571-596. <a target=\"_blank\" href=\"https://dx.doi.org/10.1142/S012905411000743X\">⟨10.1142/S012905411000743X⟩</a>", "citationFull_s":"Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Tree Automata With Global Constraints. International Journal of Foundations of Computer Science, 2010, 21 (4), pp.571-596. <a target=\"_blank\" href=\"https://dx.doi.org/10.1142/S012905411000743X\">⟨10.1142/S012905411000743X⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00526987v1\">⟨hal-00526987⟩</a>", "title_s":["Tree Automata With Global Constraints"], "authFullName_s":["Emmanuel Filiot","Jean-Marc Talbot","Sophie Tison"], "halId_s":"hal-00526987", "docType_s":"ART", "producedDateY_i":2010 },{ "citationRef_s":"Pierre Marquis, Odile Papini and Henri Prade. IA Handbook, Cépaduès, pp.1-63, 2010", "citationFull_s":"Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Décidabilité et Complexité. Pierre Marquis, Odile Papini and Henri Prade. IA Handbook, Cépaduès, pp.1-63, 2010. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00549416v1\">⟨inria-00549416⟩</a>", "title_s":["Décidabilité et Complexité"], "authFullName_s":["Olivier Bournez","Gilles Dowek","Rémi Gilleron","Serge Grigorieff","Jean-Yves Marion","Simon Perdrix","Sophie Tison"], "halId_s":"inria-00549416", "docType_s":"COUV", "producedDateY_i":2010 },{ "citationRef_s":"IA Handbook, Cépaduès, pp.1-63, 2010", "citationFull_s":"Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Décidabilité et Complexité. IA Handbook, Cépaduès, pp.1-63, 2010. <a target=\"_blank\" href=\"https://hal.science/hal-00999661v1\">⟨hal-00999661⟩</a>", "title_s":["Décidabilité et Complexité"], "authFullName_s":["Olivier Bournez","Gilles Dowek","Rémi Gilleron","Serge Grigorieff","Jean-Yves Marion","Simon Perdrix","Sophie Tison"], "halId_s":"hal-00999661", "docType_s":"COUV", "producedDateY_i":2010 },{ "citationRef_s":"17th International Symposium on Fundamentals of Computer Theory, Sep 2009, Wraclaw, Poland. pp.121-132", "citationFull_s":"Olivier Gauwin, Joachim Niehren, Sophie Tison. Earliest Query Answering for Deterministic Nested Word Automata. 17th International Symposium on Fundamentals of Computer Theory, Sep 2009, Wraclaw, Poland. pp.121-132. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00390236v2\">⟨inria-00390236v2⟩</a>", "title_s":["Earliest Query Answering for Deterministic Nested Word Automata"], "authFullName_s":["Olivier Gauwin","Joachim Niehren","Sophie Tison"], "halId_s":"inria-00390236", "docType_s":"COMM", "producedDateY_i":2009 },{ "citationRef_s":"International Symposium on Database Programming Languages, Aug 2009, LYON, France. pp 52-67", "citationFull_s":"Benoit Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison. XML Security Views Revisited. International Symposium on Database Programming Languages, Aug 2009, LYON, France. pp 52-67. <a target=\"_blank\" href=\"https://hal.science/hal-00396796v1\">⟨hal-00396796⟩</a>", "title_s":["XML Security Views Revisited"], "authFullName_s":["Benoit Groz","Slawomir Staworko","Anne-Cécile Caron","Yves Roos","Sophie Tison"], "halId_s":"hal-00396796", "docType_s":"COMM", "producedDateY_i":2009 },{ "citationRef_s":"3rd International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.350-361, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-00982-2\">⟨10.1007/978-3-642-00982-2⟩</a>", "citationFull_s":"Olivier Gauwin, Joachim Niehren, Sophie Tison. Bounded Delay and Concurrency for Earliest Query Answering. 3rd International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.350-361, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-00982-2\">⟨10.1007/978-3-642-00982-2⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00348463v1\">⟨inria-00348463⟩</a>", "title_s":["Bounded Delay and Concurrency for Earliest Query Answering"], "authFullName_s":["Olivier Gauwin","Joachim Niehren","Sophie Tison"], "halId_s":"inria-00348463", "docType_s":"COMM", "producedDateY_i":2009 },{ "citationRef_s":"12th International Conference on Developments in Language Theory (DLT), Sep 2008, Kyoto, Japan. pp.314-326", "citationFull_s":"Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Tree Automata with Global Constraints. 12th International Conference on Developments in Language Theory (DLT), Sep 2008, Kyoto, Japan. pp.314-326. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00292027v2\">⟨inria-00292027v2⟩</a>", "title_s":["Tree Automata with Global Constraints"], "authFullName_s":["Emmanuel Filiot","Jean-Marc Talbot","Sophie Tison"], "halId_s":"inria-00292027", "docType_s":"COMM", "producedDateY_i":2008 },{ "citationRef_s":"5th IFIP International Conference on Theoretical Computer Science, Sep 2008, Milano, Italy. pp.429-443", "citationFull_s":"Emmanuel Filiot, Sophie Tison. Regular n-ary Queries in Trees and Variable Independence. 5th IFIP International Conference on Theoretical Computer Science, Sep 2008, Milano, Italy. pp.429-443. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00274648v2\">⟨inria-00274648v2⟩</a>", "title_s":["Regular n-ary Queries in Trees and Variable Independence"], "authFullName_s":["Emmanuel Filiot","Sophie Tison"], "halId_s":"inria-00274648", "docType_s":"COMM", "producedDateY_i":2008 },{ "citationRef_s":"FOSSACS'08, Apr 2008, Hungary. pp.127-141", "citationFull_s":"Guillem Godoy, Sebastian Maneth, Sophie Tison. Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FOSSACS'08, Apr 2008, Hungary. pp.127-141. <a target=\"_blank\" href=\"https://hal.science/hal-00243123v1\">⟨hal-00243123⟩</a>", "title_s":["Classes of Tree Homomorphisms with Decidable Preservation of Regularity"], "authFullName_s":["Guillem Godoy","Sebastian Maneth","Sophie Tison"], "halId_s":"hal-00243123", "docType_s":"COMM", "producedDateY_i":2008 },{ "citationRef_s":"ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), Jan 2008, San Francisco, United States", "citationFull_s":"Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison. Complexity of Earliest Query Answering with Streaming Tree Automata. ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), Jan 2008, San Francisco, United States. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00336169v1\">⟨inria-00336169⟩</a>", "title_s":["Complexity of Earliest Query Answering with Streaming Tree Automata"], "authFullName_s":["Olivier Gauwin","Anne-Cécile Caron","Joachim Niehren","Sophie Tison"], "halId_s":"inria-00336169", "docType_s":"COMM", "producedDateY_i":2008 },{ "citationRef_s":"Theoretical Computer Science, 2007, 385 (1-3), pp.11-33. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2007.05.010\">⟨10.1016/j.tcs.2007.05.010⟩</a>", "citationFull_s":"Yves André, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison. Path constraints in semistructured data. Theoretical Computer Science, 2007, 385 (1-3), pp.11-33. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2007.05.010\">⟨10.1016/j.tcs.2007.05.010⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00189067v1\">⟨hal-00189067⟩</a>", "title_s":["Path constraints in semistructured data"], "authFullName_s":["Yves André","Anne-Cécile Caron","Denis Debarbieux","Yves Roos","Sophie Tison"], "halId_s":"hal-00189067", "docType_s":"ART", "producedDateY_i":2007 },{ "citationRef_s":"16th EACSL Annual Conference on Computer Science and Logic, Sep 2007, Lausanne, Switzerland. pp.130-145, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-540-74915-8_13\">⟨10.1007/978-3-540-74915-8_13⟩</a>", "citationFull_s":"Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Satisfiability of a Spatial Logic with Tree Variables. 16th EACSL Annual Conference on Computer Science and Logic, Sep 2007, Lausanne, Switzerland. pp.130-145, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-540-74915-8_13\">⟨10.1007/978-3-540-74915-8_13⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00148462v2\">⟨inria-00148462v2⟩</a>", "title_s":["Satisfiability of a Spatial Logic with Tree Variables"], "authFullName_s":["Emmanuel Filiot","Jean-Marc Talbot","Sophie Tison"], "halId_s":"inria-00148462", "docType_s":"COMM", "producedDateY_i":2007 },{ "citationRef_s":"26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Jun 2007, Beijing, China. pp.205-214", "citationFull_s":"Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. Polynomial Time Fragments of XPath with Variables. 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Jun 2007, Beijing, China. pp.205-214. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00135678v1\">⟨inria-00135678⟩</a>", "title_s":["Polynomial Time Fragments of XPath with Variables"], "authFullName_s":["Emmanuel Filiot","Joachim Niehren","Jean-Marc Talbot","Sophie Tison"], "halId_s":"inria-00135678", "docType_s":"COMM", "producedDateY_i":2007 },{ "citationRef_s":"CADE, 2007, Germany. pp.247-262, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-540-73595-3_17\">⟨10.1007/978-3-540-73595-3_17⟩</a>", "citationFull_s":"Guillem Godoy, Sophie Tison. On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE, 2007, Germany. pp.247-262, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-540-73595-3_17\">⟨10.1007/978-3-540-73595-3_17⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00190004v1\">⟨hal-00190004⟩</a>", "title_s":["On the Normalization and Unique Normalization Properties of Term Rewrite Systems"], "authFullName_s":["Guillem Godoy","Sophie Tison"], "halId_s":"hal-00190004", "docType_s":"COMM", "producedDateY_i":2007 },{ "citationRef_s":"PLAN-X, 2006, Unknown, Unknown Region. pp.61-70, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-319-04939-7_13\">⟨10.1007/978-3-319-04939-7_13⟩</a>", "citationFull_s":"Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. Composing Monadic Queries in Trees. PLAN-X, 2006, Unknown, Unknown Region. pp.61-70, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-319-04939-7_13\">⟨10.1007/978-3-319-04939-7_13⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01196266v1\">⟨hal-01196266⟩</a>", "title_s":["Composing Monadic Queries in Trees"], "authFullName_s":["Emmanuel Filiot","Joachim Niehren","Jean-Marc Talbot","Sophie Tison"], "halId_s":"hal-01196266", "docType_s":"COMM", "producedDateY_i":2006 },{ "citationRef_s":"12th International Conference on Logic for Programming Artificial Intelligence and Reasoning, 2005, Montego Bay, Jamaica. pp.337-351", "citationFull_s":"Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos. Monotone AC-Tree Automata. 12th International Conference on Logic for Programming Artificial Intelligence and Reasoning, 2005, Montego Bay, Jamaica. pp.337-351. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536693v1\">⟨inria-00536693⟩</a>", "title_s":["Monotone AC-Tree Automata"], "authFullName_s":["Hitoshi Ohsaki","Jean-Marc Talbot","Sophie Tison","Yves Roos"], "halId_s":"inria-00536693", "docType_s":"COMM", "producedDateY_i":2005 },{ "citationRef_s":"20th Annual IEEE Symposium on Logic in Computer Science, 2005, Chicago, United States. pp.280--289", "citationFull_s":"Iovka Boneva, Jean-Marc Talbot, Sophie Tison. Expressiveness of a spatial logic for trees. 20th Annual IEEE Symposium on Logic in Computer Science, 2005, Chicago, United States. pp.280--289. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536696v1\">⟨inria-00536696⟩</a>", "title_s":["Expressiveness of a spatial logic for trees"], "authFullName_s":["Iovka Boneva","Jean-Marc Talbot","Sophie Tison"], "halId_s":"inria-00536696", "docType_s":"COMM", "producedDateY_i":2005 },{ "citationRef_s":"10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. pp.217--231", "citationFull_s":"Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison. N-ary Queries by Tree Automata. 10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. pp.217--231. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536522v1\">⟨inria-00536522⟩</a>", "title_s":["N-ary Queries by Tree Automata"], "authFullName_s":["Joachim Niehren","Laurent Planque","Jean-Marc Talbot","Sophie Tison"], "halId_s":"inria-00536522", "docType_s":"COMM", "producedDateY_i":2005 },{ "citationRef_s":"29th Symposium on Mathematical Foundations of Computer Science, 2004, Prague, Costa Rica. pp.863-875", "citationFull_s":"Yves André, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison. Extraction and Implication of Path Constraints. 29th Symposium on Mathematical Foundations of Computer Science, 2004, Prague, Costa Rica. pp.863-875. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536715v1\">⟨inria-00536715⟩</a>", "title_s":["Extraction and Implication of Path Constraints"], "authFullName_s":["Yves André","Anne-Cécile Caron","Denis Debarbieux","Yves Roos","Sophie Tison"], "halId_s":"inria-00536715", "docType_s":"COMM", "producedDateY_i":2004 },{ "citationRef_s":"4th International Conference on Combinatorics on Words, 2003, Turku, Finland. pp.358--369", "citationFull_s":"Denis Debarbieux, Yves Roos, Sophie Tison, Yves André, Anne-Cécile Caron. Path Rewriting in Semistructured Data. 4th International Conference on Combinatorics on Words, 2003, Turku, Finland. pp.358--369. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536731v1\">⟨inria-00536731⟩</a>", "title_s":["Path Rewriting in Semistructured Data"], "authFullName_s":["Denis Debarbieux","Yves Roos","Sophie Tison","Yves André","Anne-Cécile Caron"], "halId_s":"inria-00536731", "docType_s":"COMM", "producedDateY_i":2003 },{ "citationRef_s":"Theoretical Computer Science, 2002, 281 (1-2), pp.219-233. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/S0304-3975(02)00014-2\">⟨10.1016/S0304-3975(02)00014-2⟩</a>", "citationFull_s":"Max Dauchet, Sophie Tison, Marc Tommasi. Réduction de la non-linéarité des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. Theoretical Computer Science, 2002, 281 (1-2), pp.219-233. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/S0304-3975(02)00014-2\">⟨10.1016/S0304-3975(02)00014-2⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02193763v1\">⟨hal-02193763⟩</a>", "title_s":["Réduction de la non-linéarité des morphismes d'arbres Recognizable tree-languages and non-linear morphisms"], "authFullName_s":["Max Dauchet","Sophie Tison","Marc Tommasi"], "halId_s":"hal-02193763", "docType_s":"ART", "producedDateY_i":2002 },{ "citationRef_s":"Theoretical Computer Science, 2001, 258 (1-2), pp.453-490. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/S0304-3975(00)00032-3\">⟨10.1016/S0304-3975(00)00032-3⟩</a>", "citationFull_s":"Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen. Grid structures and undecidable constraint theories. Theoretical Computer Science, 2001, 258 (1-2), pp.453-490. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/S0304-3975(00)00032-3\">⟨10.1016/S0304-3975(00)00032-3⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02193758v1\">⟨hal-02193758⟩</a>", "title_s":["Grid structures and undecidable constraint theories"], "authFullName_s":["Franck Seynhaeve","Sophie Tison","Marc Tommasi","Ralf Treinen"], "halId_s":"hal-02193758", "docType_s":"ART", "producedDateY_i":2001 },{ "citationRef_s":"Constraints, 2000, 5 (1/2), pp.161-202. <a target=\"_blank\" href=\"https://dx.doi.org/10.1023/A:1009826603139\">⟨10.1023/A:1009826603139⟩</a>", "citationFull_s":"Jean-Marc Talbot, Philippe Devienne, Sophie Tison. Generalized Definite Set Constraints. Constraints, 2000, 5 (1/2), pp.161-202. <a target=\"_blank\" href=\"https://dx.doi.org/10.1023/A:1009826603139\">⟨10.1023/A:1009826603139⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02193768v1\">⟨hal-02193768⟩</a>", "title_s":["Generalized Definite Set Constraints"], "authFullName_s":["Jean-Marc Talbot","Philippe Devienne","Sophie Tison"], "halId_s":"hal-02193768", "docType_s":"ART", "producedDateY_i":2000 },{ "citationRef_s":"Rewriting Techniques and Applications, 11th International Conference, RTA 2000, 2000, Norwich, United Kingdom. pp.27-30", "citationFull_s":"Sophie Tison. Tree Automata and Term Rewrite Systems. Rewriting Techniques and Applications, 11th International Conference, RTA 2000, 2000, Norwich, United Kingdom. pp.27-30. <a target=\"_blank\" href=\"https://hal.science/hal-02193893v1\">⟨hal-02193893⟩</a>", "title_s":["Tree Automata and Term Rewrite Systems"], "authFullName_s":["Sophie Tison"], "halId_s":"hal-02193893", "docType_s":"COMM", "producedDateY_i":2000 },{ "citationRef_s":"Information Processing Letters, 2000, 74 (1-2), pp.35--40", "citationFull_s":"Joachim Niehren, Ralf Treinen, Sophie Tison. On Rewrite Constraints and Context Unification. Information Processing Letters, 2000, 74 (1-2), pp.35--40. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536802v1\">⟨inria-00536802⟩</a>", "title_s":["On Rewrite Constraints and Context Unification"], "authFullName_s":["Joachim Niehren","Ralf Treinen","Sophie Tison"], "halId_s":"inria-00536802", "docType_s":"ART", "producedDateY_i":2000 },{ "citationRef_s":"FCT 1999 - International Symposium on Fundamentals of Computation Theory, Aug 1999, Iasi, Romania. pp.475-487, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/3-540-48321-7_40\">⟨10.1007/3-540-48321-7_40⟩</a>", "citationFull_s":"Franck Seynhaeve, Sophie Tison, Marc Tommasi. Homomorphisms and concurrent term rewriting. FCT 1999 - International Symposium on Fundamentals of Computation Theory, Aug 1999, Iasi, Romania. pp.475-487, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/3-540-48321-7_40\">⟨10.1007/3-540-48321-7_40⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02193779v1\">⟨hal-02193779⟩</a>", "title_s":["Homomorphisms and concurrent term rewriting"], "authFullName_s":["Franck Seynhaeve","Sophie Tison","Marc Tommasi"], "halId_s":"hal-02193779", "docType_s":"COMM", "producedDateY_i":1999 },{ "citationRef_s":"Information and Computation, 1999, 149 (1), pp.1--41", "citationFull_s":"Rémi Gilleron, Sophie Tison, Marc Tommasi. Set constraints and automata. Information and Computation, 1999, 149 (1), pp.1--41. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538886v1\">⟨inria-00538886⟩</a>", "title_s":["Set constraints and automata"], "authFullName_s":["Rémi Gilleron","Sophie Tison","Marc Tommasi"], "halId_s":"inria-00538886", "docType_s":"ART", "producedDateY_i":1999 },{ "citationRef_s":"Foundations of Software Science and Computation Structure, FoSSaCS'99,, 1999, Amsterdam, Netherlands. pp.150-164", "citationFull_s":"Bruno Bogaert, Franck Seynhaeve, Sophie Tison. The Recognizability Problem for Tree Automata with Comparisons between Brothers. Foundations of Software Science and Computation Structure, FoSSaCS'99,, 1999, Amsterdam, Netherlands. pp.150-164. <a target=\"_blank\" href=\"https://hal.science/hal-02193786v1\">⟨hal-02193786⟩</a>", "title_s":["The Recognizability Problem for Tree Automata with Comparisons between Brothers"], "authFullName_s":["Bruno Bogaert","Franck Seynhaeve","Sophie Tison"], "halId_s":"hal-02193786", "docType_s":"COMM", "producedDateY_i":1999 },{ "citationRef_s":"Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, 1999, Unknown, Unknown Region. pp.103--117, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/3-540-48685-2_9\">⟨10.1007/3-540-48685-2_9⟩</a>", "citationFull_s":"Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi. Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, 1999, Unknown, Unknown Region. pp.103--117, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/3-540-48685-2_9\">⟨10.1007/3-540-48685-2_9⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01820502v1\">⟨hal-01820502⟩</a>", "title_s":["Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting"], "authFullName_s":["Anne-Cécile Caron","Franck Seynhaeve","Sophie Tison","Marc Tommasi"], "halId_s":"hal-01820502", "docType_s":"COMM", "producedDateY_i":1999 },{ "citationRef_s":"Static Analysis, 4th International Symposium, SAS '97, 1997, Paris, France. pp.127-140", "citationFull_s":"J. Talbot, S. Tison, P. Devienne. Set-based analysis for logic programming and tree automata. Static Analysis, 4th International Symposium, SAS '97, 1997, Paris, France. pp.127-140. <a target=\"_blank\" href=\"https://hal.science/hal-02193771v1\">⟨hal-02193771⟩</a>", "title_s":["Set-based analysis for logic programming and tree automata"], "authFullName_s":["J. Talbot","S. Tison","P. Devienne"], "halId_s":"hal-02193771", "docType_s":"COMM", "producedDateY_i":1997 },{ "citationRef_s":"Principles and Practice of Constraint Programming, CP97, 1997, Linz, Austria. pp.62-76", "citationFull_s":"P. Devienne, J. Talbot, S. Tison. Solving classes of set constraints with tree automata. Principles and Practice of Constraint Programming, CP97, 1997, Linz, Austria. pp.62-76. <a target=\"_blank\" href=\"https://hal.science/hal-02193791v1\">⟨hal-02193791⟩</a>", "title_s":["Solving classes of set constraints with tree automata"], "authFullName_s":["P. Devienne","J. Talbot","S. Tison"], "halId_s":"hal-02193791", "docType_s":"COMM", "producedDateY_i":1997 },{ "citationRef_s":"Fundamenta Informaticae, 1995, 24 (1/2), pp.157--176", "citationFull_s":"Rémi Gilleron, Sophie Tison. Regular Tree Languages and Rewrite Systems. Fundamenta Informaticae, 1995, 24 (1/2), pp.157--176. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538882v1\">⟨inria-00538882⟩</a>", "title_s":["Regular Tree Languages and Rewrite Systems"], "authFullName_s":["Rémi Gilleron","Sophie Tison"], "halId_s":"inria-00538882", "docType_s":"ART", "producedDateY_i":1995 },{ "citationRef_s":"Proceedings of First International Conference on Constraints in Computational Logics, CCL'94, 1994, Munich, Germany. pp.336--351", "citationFull_s":"Rémi Gilleron, Sophie Tison, Marc Tommasi. Some new Decidability Results on Positive and Negative Set Constraints. Proceedings of First International Conference on Constraints in Computational Logics, CCL'94, 1994, Munich, Germany. pp.336--351. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538880v1\">⟨inria-00538880⟩</a>", "title_s":["Some new Decidability Results on Positive and Negative Set Constraints"], "authFullName_s":["Rémi Gilleron","Sophie Tison","Marc Tommasi"], "halId_s":"inria-00538880", "docType_s":"COMM", "producedDateY_i":1994 },{ "citationRef_s":"Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS'93, 1993, Würzburg, Germany. pp.505--514", "citationFull_s":"Rémi Gilleron, Sophie Tison, Marc Tommasi. Solving Systems of Set Constraints using Tree Automata. Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS'93, 1993, Würzburg, Germany. pp.505--514. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538878v1\">⟨inria-00538878⟩</a>", "title_s":["Solving Systems of Set Constraints using Tree Automata"], "authFullName_s":["Rémi Gilleron","Sophie Tison","Marc Tommasi"], "halId_s":"inria-00538878", "docType_s":"COMM", "producedDateY_i":1993 },{ "citationRef_s":"Proceedings of the $34^th$ Symposium on Foundations of Computer Science, FOCS'93, 1993, Palo Alto California, United States. pp.372--380", "citationFull_s":"Rémi Gilleron, Sophie Tison, Marc Tommasi. Solving Systems of Set Constraints with Negated Subset Relationships. Proceedings of the $34^th$ Symposium on Foundations of Computer Science, FOCS'93, 1993, Palo Alto California, United States. pp.372--380. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538879v1\">⟨inria-00538879⟩</a>", "title_s":["Solving Systems of Set Constraints with Negated Subset Relationships"], "authFullName_s":["Rémi Gilleron","Sophie Tison","Marc Tommasi"], "halId_s":"inria-00538879", "docType_s":"COMM", "producedDateY_i":1993 },{ "citationRef_s":"STACS 1992, 1992, Cachan, France. pp.159-171", "citationFull_s":"B. Bogaert, S. Tison. Equality and disequality constraints on direct subterms in tree automata. STACS 1992, 1992, Cachan, France. pp.159-171. <a target=\"_blank\" href=\"https://hal.science/hal-02193917v1\">⟨hal-02193917⟩</a>", "title_s":["Equality and disequality constraints on direct subterms in tree automata"], "authFullName_s":["B. Bogaert","S. Tison"], "halId_s":"hal-02193917", "docType_s":"COMM", "producedDateY_i":1992 },{ "citationRef_s":"Information and Computation, 1990, 88 (2), pp.187-201. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/0890-5401(90)90015-A\">⟨10.1016/0890-5401(90)90015-A⟩</a>", "citationFull_s":"Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation, 1990, 88 (2), pp.187-201. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/0890-5401(90)90015-A\">⟨10.1016/0890-5401(90)90015-A⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02193891v1\">⟨hal-02193891⟩</a>", "title_s":["Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems"], "authFullName_s":["Max Dauchet","Thierry Heuillard","Pierre Lescanne","Sophie Tison"], "halId_s":"hal-02193891", "docType_s":"ART", "producedDateY_i":1990 },{ "citationRef_s":"Fifth Annual IEEE Symposium on Logic in Computer Science, 1990, Philadelphia, United States. pp.242-248", "citationFull_s":"M. Dauchet, S. Tison. The theory of ground rewrite systems is decidable. Fifth Annual IEEE Symposium on Logic in Computer Science, 1990, Philadelphia, United States. pp.242-248. <a target=\"_blank\" href=\"https://hal.science/hal-02193918v1\">⟨hal-02193918⟩</a>", "title_s":["The theory of ground rewrite systems is decidable"], "authFullName_s":["M. Dauchet","S. Tison"], "halId_s":"hal-02193918", "docType_s":"COMM", "producedDateY_i":1990 },{ "citationRef_s":"Rewriting Techniques and Applications, RTA-89,, 1989, Chapel Hill, United States. pp.462-476", "citationFull_s":"Sophie Tison. Fair termination is decidable for ground systems. Rewriting Techniques and Applications, RTA-89,, 1989, Chapel Hill, United States. pp.462-476. <a target=\"_blank\" href=\"https://hal.science/hal-02193919v1\">⟨hal-02193919⟩</a>", "title_s":["Fair termination is decidable for ground systems"], "authFullName_s":["Sophie Tison"], "halId_s":"hal-02193919", "docType_s":"COMM", "producedDateY_i":1989 },{ "citationRef_s":"Fundamentals of Computation Theory, FCT'89, 1989, Szeged, Hungary. pp.105-115", "citationFull_s":"Jean-Luc Coquidé, Max Dauchet, Sophie Tison. About connections between syntactical and computational complexity. Fundamentals of Computation Theory, FCT'89, 1989, Szeged, Hungary. pp.105-115. <a target=\"_blank\" href=\"https://hal.science/hal-02193920v1\">⟨hal-02193920⟩</a>", "title_s":["About connections between syntactical and computational complexity"], "authFullName_s":["Jean-Luc Coquidé","Max Dauchet","Sophie Tison"], "halId_s":"hal-02193920", "docType_s":"COMM", "producedDateY_i":1989 },{ "citationRef_s":"LICS 1987 - Second Annual IEEE Symposium on Logic in Computer Science, Jun 1987, Ithaca, New York, United States", "citationFull_s":"Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne. Decidability of the Confluence of Ground Term Rewriting Systems.. LICS 1987 - Second Annual IEEE Symposium on Logic in Computer Science, Jun 1987, Ithaca, New York, United States. <a target=\"_blank\" href=\"https://hal.science/hal-02193998v1\">⟨hal-02193998⟩</a>", "title_s":["Decidability of the Confluence of Ground Term Rewriting Systems."], "authFullName_s":["Max Dauchet","Sophie Tison","Thierry Heuillard","Pierre Lescanne"], "halId_s":"hal-02193998", "docType_s":"COMM", "producedDateY_i":1987 },{ "citationRef_s":"[Research Report] RR-0675, INRIA. 1987", "citationFull_s":"Pierre Lescanne, Thierry Heuillard, Max Dauchet, Sophie Tison. Decidability of the confluence of ground term rewriting systems. [Research Report] RR-0675, INRIA. 1987. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00075878v1\">⟨inria-00075878⟩</a>", "title_s":["Decidability of the confluence of ground term rewriting systems"], "authFullName_s":["Pierre Lescanne","Thierry Heuillard","Max Dauchet","Sophie Tison"], "halId_s":"inria-00075878", "docType_s":"REPORT", "producedDateY_i":1987 },{ "citationRef_s":"Fundamentals of Computation Theory, FCT'85, 1985, Cottbus, Germany. pp.80-89", "citationFull_s":"M. Dauchet, S. Tison. Decidability of confluence for ground term rewriting systems. Fundamentals of Computation Theory, FCT'85, 1985, Cottbus, Germany. pp.80-89. <a target=\"_blank\" href=\"https://hal.science/hal-02193990v1\">⟨hal-02193990⟩</a>", "title_s":["Decidability of confluence for ground term rewriting systems"], "authFullName_s":["M. Dauchet","S. Tison"], "halId_s":"hal-02193990", "docType_s":"COMM", "producedDateY_i":1985 },{ "citationRef_s":"Fundamentals of Computation Theory, FCT'83, 1983, Borgholm, Sweden. pp.465-474", "citationFull_s":"S. Tison, M. Dauchet, G. Comyn. Metrical and ordered properties of powerdomains. Fundamentals of Computation Theory, FCT'83, 1983, Borgholm, Sweden. pp.465-474. <a target=\"_blank\" href=\"https://hal.science/hal-02193994v1\">⟨hal-02193994⟩</a>", "title_s":["Metrical and ordered properties of powerdomains"], "authFullName_s":["S. Tison","M. Dauchet","G. Comyn"], "halId_s":"hal-02193994", "docType_s":"COMM", "producedDateY_i":1983 }] } }

Rechercher

Paramétrage

Thèmes

Accessibilité

Sophie Tison

Publications