Amélie Gheerbrant

Orcid: 0000-0002-8936-9829

According to our database1, Amélie Gheerbrant authored at least 19 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings.
Theory Pract. Log. Program., March, 2024

2023
GPC: A Pattern Calculus for Property Graphs.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

A Researcher's Digest of GQL (Invited Talk).
Proceedings of the 26th International Conference on Database Theory, 2023

2022
Certain Answers of Extensions of Conjunctive Queries by Datalog and First-Order Rewriting.
Proceedings of the 4th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2022) co-located with the 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2022), 2022

2019
Best Answers over Incomplete Data : Complexity and First-Order Rewritings.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2015
Certain Answers over Incomplete XML Documents: Extending Tractability Boundary.
Theory Comput. Syst., 2015

2014
Naïve Evaluation of Queries over Incomplete Databases.
ACM Trans. Database Syst., 2014

Querying Incomplete Graphs with Data.
Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

2013
Reasoning About Pattern-Based XML Queries.
Proceedings of the Web Reasoning and Rule Systems - 7th International Conference, 2013

When is naive evaluation possible?
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Containment of pattern-based queries over data trees.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Static Analysis and Query Answering for Incomplete Data Trees with Constraints.
Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

2012
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
Log. Methods Comput. Sci., 2012

On the complexity of query answering over incomplete XML documents.
Proceedings of the 15th International Conference on Database Theory, 2012

2010
Game Solution, Epistemic Dynamics and Fixed-Point Logics.
Fundam. Informaticae, 2010

Complete Axiomatization of the Stutter-invariant Fragment of the Linear Time mu-calculus.
Proceedings of the Advances in Modal Logic 8, 2010

2009
Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

Craig Interpolation for Linear Temporal Languages.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2006
Recursive complexity of the Carnap first order modal logic C.
Math. Log. Q., 2006


  Loading...