default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGaëlle Fontaine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j8]Gaëlle Fontaine, Fabio Mogavero
, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino:
Cycle detection in computation tree logic. Inf. Comput. 262: 265-279 (2018)- [j7]Gaëlle Fontaine, Yde Venema:
Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties. Log. Methods Comput. Sci. 14(1) (2018) - [i1]Gaëlle Fontaine, Yde Venema:
Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties. CoRR abs/1801.05994 (2018) - 2017
- [j6]Pablo Barceló, Gaëlle Fontaine:
On the data complexity of consistent query answering over graph databases. J. Comput. Syst. Sci. 88: 164-194 (2017) - 2016
- [c12]Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino:
Cycle Detection in Computation Tree Logic. GandALF 2016: 164-177 - 2015
- [j5]Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin:
Expressive Path Queries on Graph with Data. Log. Methods Comput. Sci. 11(4) (2015) - [j4]Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis:
On the Data Complexity of Consistent Query Answering. Theory Comput. Syst. 57(4): 843-891 (2015) - [j3]Gaëlle Fontaine:
Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? ACM Trans. Comput. Log. 16(1): 7:1-7:24 (2015) - [c11]Pablo Barceló, Gaëlle Fontaine:
On the Data Complexity of Consistent Query Answering over Graph Databases. ICDT 2015: 380-397 - 2014
- [c10]Amélie Gheerbrant, Gaëlle Fontaine:
Querying Incomplete Graphs with Data. AMW 2014 - 2013
- [c9]Gaëlle Fontaine:
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? LICS 2013: 550-559 - [c8]Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin:
Expressive Path Queries on Graphs with Data. LPAR 2013: 71-85 - 2012
- [c7]Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis:
On the data complexity of consistent query answering. ICDT 2012: 22-33 - 2010
- [j2]Balder ten Cate, Gaëlle Fontaine, Tadeusz Litak:
Some modal aspects of XPath. J. Appl. Non Class. Logics 20(3): 139-171 (2010) - [j1]Nick Bezhanishvili, Gaëlle Fontaine, Yde Venema:
Vietoris Bisimulations. J. Log. Comput. 20(5): 1017-1040 (2010) - [c6]Balder ten Cate, Gaëlle Fontaine:
An Easy Completeness Proof for the Modal µ-Calculus on Finite Trees. FoSSaCS 2010: 161-175 - [c5]Gaëlle Fontaine, Raul Andres Leal, Yde Venema:
Automata for Coalgebras: An Approach Using Predicate Liftings. ICALP (2) 2010: 381-392 - [c4]Gaëlle Fontaine, Thomas Place:
Frame Definability for Classes of Trees in the µ-calculus. MFCS 2010: 381-392
2000 – 2009
- 2009
- [c3]Balder ten Cate, Gaëlle Fontaine:
An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees. FICS 2009: 30-38 - 2008
- [c2]Gaëlle Fontaine:
Continuous Fragment of the mu-Calculus. CSL 2008: 139-153 - 2006
- [c1]Gaëlle Fontaine:
ML is not finitely axiomatizable over Cheq. Advances in Modal Logic 2006: 139-146
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
