Gaëlle Fontaine

Publication Activity (10 Years)

Years Active: 2006-2018
Publications (10 Years): 5

Top Topics

Data Complexity

Datalog Programs

Consistent Query Answering

Top Venues

Log. Methods Comput. Sci.

J. Comput. Syst. Sci.

Publications

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