Gaëlle Fontaine

According to our database, Gaëlle Fontaine authored at least 17 papers between 2006 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Corrections to "On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164-194]".

Pablo Barceló, Gaëlle Fontaine, Sylvain Salvati, Sophie Tison

J. Comput. Syst. Sci., 2026

2018

Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties.

Gaëlle Fontaine, Yde Venema

Log. Methods Comput. Sci., 2018

Cycle detection in computation tree logic.

Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino

Inf. Comput., 2018

2015

Expressive Path Queries on Graph with Data.

Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin

Log. Methods Comput. Sci., 2015

On the Data Complexity of Consistent Query Answering over Graph Databases.

Pablo Barceló, Gaëlle Fontaine

Proceedings of the 18th International Conference on Database Theory, 2015

2014

Querying Incomplete Graphs with Data.

Amélie Gheerbrant, Gaëlle Fontaine

Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

2013

Expressive Path Queries on Graphs with Data.

Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?

Gaëlle Fontaine

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012

On the data complexity of consistent query answering.

Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis

Proceedings of the 15th International Conference on Database Theory, 2012

2010

Vietoris Bisimulations.

Nick Bezhanishvili, Gaëlle Fontaine, Yde Venema

J. Log. Comput., 2010

Some modal aspects of XPath.

Balder ten Cate, Gaëlle Fontaine, Tadeusz Litak

J. Appl. Non Class. Logics, 2010

Frame Definability for Classes of Trees in the <i>µ</i>-calculus.

Gaëlle Fontaine, Thomas Place

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Automata for Coalgebras: An Approach Using Predicate Liftings.

Gaëlle Fontaine, Raul Andres Leal, Yde Venema

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

An Easy Completeness Proof for the Modal <i>µ</i>-Calculus on Finite Trees.

Balder ten Cate, Gaëlle Fontaine

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

2009

An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees.

Balder ten Cate, Gaëlle Fontaine

Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

2008

Continuous Fragment of the mu-Calculus.

Gaëlle Fontaine

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2006

ML is not finitely axiomatizable over Cheq.

Gaëlle Fontaine

Proceedings of the Advances in Modal Logic 6, 2006