Amélie Gheerbrant
Amélie Gheerbrant
Lecturer, LIAFA (University Paris Diderot – Paris 7 & CNRS)
Zweryfikowany adres z liafa.univ-paris-diderot.fr - Strona główna
Cytowane przez
Cytowane przez
Game solution, epistemic dynamics and fixed-point logics
J Van Benthem, A Gheerbrant
Fundamenta Informaticae 100 (1-4), 19-41, 2010
Naïve evaluation of queries over incomplete databases
A Gheerbrant, L Libkin, C Sirangelo
ACM Transactions on Database Systems (TODS) 39 (4), 1-42, 2014
Containment of pattern-based queries over data trees
C David, A Gheerbrant, L Libkin, W Martens
Proceedings of the 16th International Conference on Database Theory, 201-212, 2013
On the complexity of query answering over incomplete XML documents
A Gheerbrant, L Libkin, T Tan
Proceedings of the 15th International Conference on Database Theory, 169-181, 2012
When is naive evaluation possible?
A Gheerbrant, L Libkin, C Sirangelo
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2013
Fixed-point logics on trees
A Gheerbrant
University of Amsterdam, 2010
Craig interpolation for linear temporal languages
A Gheerbrant, B Cate
International Workshop on Computer Science Logic, 287-301, 2009
Complete Axiomatizations of MSO, FO(TC1) and FO(LFP1) on Finite Trees
A Gheerbrant, B Cate
International Symposium on Logical Foundations of Computer Science, 180-196, 2009
Certain answers over incomplete XML documents: Extending tractability boundary
A Gheerbrant, L Libkin
Theory of Computing Systems 57 (4), 892-926, 2015
Complete axiomatizations of fragments of monadic second-order logic on finite trees
B Cate, A Gheerbrant
Logical Methods in Computer Science 8, 2012
Recursive complexity of the Carnap first order modal logic C
A Gheerbrant, M Mostowski
Mathematical Logic Quarterly 52 (1), 87-94, 2006
Reasoning about pattern-based XML queries
A Gheerbrant, L Libkin, C Sirangelo
International Conference on Web Reasoning and Rule Systems, 4-18, 2013
Best answers over incomplete data: Complexity and first-order rewritings
A Gheerbrant, C Sirangelo
the Twenty-Eighth International Joint Conference on Artificial Intelligence …, 2019
Complete Axiomatization of the Stutter-Invariant Fragment of the Linear-time mu-calculus
A Gheerbrant
Complete Axiomatizations of MSO, FO (TC1) and FO (LFP1) on finite trees
B ten Cate, A Gheerbrant
LFCS, 2009
Static Analysis and Query Answering for Incomplete Data Trees with Constraints
A Gheerbrant, L Libkin, J Reutter
In Search of Elegance in the Theory and Practice of Computation, 273-290, 2013
SOURCE (OR PART OF THE FOLLOWING SOURCE): Type PhD thesis Title Fixed-point logics on trees
AP Gheerbrant
Increasing the expressive power of the Carnap first order modal logic C
A Gheerbrant
Actas del V Congreso de la Sociedad de Lógica, Metodología y Filosofía de la …, 2006
Incomplete information, monotonicity and homomorphism preservation
A Gheerbrant, L Libkin, C Sirangelo
Querying incomplete graphs with data
G Fontaine, A Gheerbrant
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20