default search action
Amélie Gheerbrant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Amélie Gheerbrant
, Leonid Libkin, Alexandra Rogova, Cristina Sirangelo:
Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings. Theory Pract. Log. Program. 24(2): 279-309 (2024) - [i3]Amélie Gheerbrant, Leonid Libkin, Liat Peterfreund, Alexandra Rogova:
GQL and SQL/PGQ: Theoretical Models and Expressive Power. CoRR abs/2409.01102 (2024) - 2023
- [c13]Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault
A Researcher's Digest of GQL (Invited Talk). ICDT 2023: 1:1-1:22 - [c12]Nadime Francis
GPC: A Pattern Calculus for Property Graphs. PODS 2023: 241-250 - [i2]Amélie Gheerbrant, Leonid Libkin, Alexandra Rogova, Cristina Sirangelo:
Querying Incomplete Data : Complexity and Tractability via Datalog and First-Order Rewritings. CoRR abs/2310.12694 (2023) - 2022
- [c11]Amélie Gheerbrant, Leonid Libkin, Alexandra Rogova, Cristina Sirangelo:
Certain Answers of Extensions of Conjunctive Queries by Datalog and First-Order Rewriting. Datalog 2022: 14-26 - [i1]Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc:
GPC: A Pattern Calculus for Property Graphs. CoRR abs/2210.16580 (2022)
2010 – 2019
- 2019
- [c10]Amélie Gheerbrant, Cristina Sirangelo:
Best Answers over Incomplete Data : Complexity and First-Order Rewritings. IJCAI 2019: 1704-1710 - 2015
- [j5]Amélie Gheerbrant, Leonid Libkin
Certain Answers over Incomplete XML Documents: Extending Tractability Boundary. Theory Comput. Syst. 57(4): 892-926 (2015) - 2014
- [j4]Amélie Gheerbrant, Leonid Libkin
Naïve Evaluation of Queries over Incomplete Databases. ACM Trans. Database Syst. 39(4): 31:1-31:42 (2014) - [c9]Amélie Gheerbrant, Gaëlle Fontaine:
Querying Incomplete Graphs with Data. AMW 2014 - 2013
- [c8]Amélie Gheerbrant, Leonid Libkin
Static Analysis and Query Answering for Incomplete Data Trees with Constraints. In Search of Elegance in the Theory and Practice of Computation 2013: 273-290 - [c7]Claire David, Amélie Gheerbrant, Leonid Libkin
Containment of pattern-based queries over data trees. ICDT 2013: 201-212 - [c6]Amélie Gheerbrant, Leonid Libkin
When is naive evaluation possible? PODS 2013: 75-86 - [c5]Amélie Gheerbrant, Leonid Libkin
Reasoning About Pattern-Based XML Queries. RR 2013: 4-18 - 2012
- [j3]Amélie Gheerbrant, Balder ten Cate:
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees. Log. Methods Comput. Sci. 8(4) (2012) - [c4]Amélie Gheerbrant, Leonid Libkin
On the complexity of query answering over incomplete XML documents. ICDT 2012: 169-181 - 2010
- [j2]Johan van Benthem, Amélie Gheerbrant:
Game Solution, Epistemic Dynamics and Fixed-Point Logics. Fundam. Informaticae 100(1-4): 19-41 (2010) - [c3]Amélie Gheerbrant:
Complete Axiomatization of the Stutter-invariant Fragment of the Linear Time mu-calculus. Advances in Modal Logic 2010: 140-155
2000 – 2009
- 2009
- [c2]Amélie Gheerbrant, Balder ten Cate
Craig Interpolation for Linear Temporal Languages. CSL 2009: 287-301 - [c1]Amélie Gheerbrant, Balder ten Cate
Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees. LFCS 2009: 180-196 - 2006
- [j1]Amélie Gheerbrant, Marcin Mostowski:
Recursive complexity of the Carnap first order modal logic C. Math. Log. Q. 52(1): 87-94 (2006)
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-10-07 01:27 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: