Gaëlle Fontaine

22 papers A* 1A 2B 5Journal 10Unranked 4
YearRankTypeTitle / 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
2018 J jnl
Cycle detection in computation tree logic.
Inf. Comput.
Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino
2018 J jnl
Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties.
CoRR
Gaëlle Fontaine, Yde Venema
2018 J jnl
Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties.
Log. Methods Comput. Sci.
Gaëlle Fontaine, Yde Venema
2017 J jnl
On the data complexity of consistent query answering over graph databases.
J. Comput. Syst. Sci.
Pablo Barceló, Gaëlle Fontaine
2016 — conf
Cycle Detection in Computation Tree Logic.
GandALF
Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino
2015 J jnl
Expressive Path Queries on Graph with Data.
Log. Methods Comput. Sci.
Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin
2015 A conf
On the Data Complexity of Consistent Query Answering over Graph Databases.
ICDT
Pablo Barceló, Gaëlle Fontaine
2015 J jnl
On the Data Complexity of Consistent Query Answering.
Theory Comput. Syst.
Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis
2015 J jnl
Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?
ACM Trans. Comput. Log.
Gaëlle Fontaine
2014 — conf
Querying Incomplete Graphs with Data.
AMW
Amélie Gheerbrant, Gaëlle Fontaine
2013 B conf
Expressive Path Queries on Graphs with Data.
LPAR
Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin
2013 A* conf
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
LICS
Gaëlle Fontaine
2012 A conf
On the data complexity of consistent query answering.
ICDT
Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis
2010 B conf
An Easy Completeness Proof for the Modal
FoSSaCS
Balder ten Cate, Gaëlle Fontaine
2010 — conf
Automata for Coalgebras: An Approach Using Predicate Liftings.
ICALP (2)
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
2010 B conf
Frame Definability for Classes of Trees in the
MFCS
Gaëlle Fontaine, Thomas Place
2010 J jnl
Some modal aspects of XPath.
J. Appl. Non Class. Logics
Balder ten Cate, Gaëlle Fontaine, Tadeusz Litak
2010 J jnl
Vietoris Bisimulations.
J. Log. Comput.
Nick Bezhanishvili, Gaëlle Fontaine, Yde Venema
2009 — conf
An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees.
FICS
Balder ten Cate, Gaëlle Fontaine
2008 B conf
Continuous Fragment of the mu-Calculus.
CSL
Gaëlle Fontaine
2006 B conf
ML is not finitely axiomatizable over Cheq.
Advances in Modal Logic
Gaëlle Fontaine