| Game solution, epistemic dynamics and fixed-point logics J Van Benthem, A Gheerbrant Fundamenta Informaticae 100 (1-4), 19-41, 2010 | 54 | 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 | 26 | 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 | 22 | 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 | 19 | 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 | 15 | 2013 |
| Fixed-point logics on trees AP Gheerbrant ILLC, 2010 | 13 | 2010 |
| Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees A Gheerbrant, B ten Cate International Symposium on Logical Foundations of Computer Science, 180-196, 2009 | 11 | 2009 |
| Certain answers over incomplete XML documents: extending tractability boundary A Gheerbrant, L Libkin Theory of Computing Systems 57 (4), 892-926, 2015 | 8 | 2015 |
| Craig interpolation for linear temporal languages A Gheerbrant, B Ten Cate International Workshop on Computer Science Logic, 287-301, 2009 | 8 | 2009 |
| Recursive complexity of the Carnap first order modal logic C A Gheerbrant, M Mostowski Mathematical Logic Quarterly 52 (1), 87-94, 2006 | 8 | 2006 |
| Reasoning about pattern-based XML queries A Gheerbrant, L Libkin, C Sirangelo International Conference on Web Reasoning and Rule Systems, 4-18, 2013 | 6 | 2013 |
| Complete axiomatizations of fragments of monadic second-order logic on finite trees A Gheerbrant, B Cate arXiv preprint arXiv:1210.2620, 2012 | 6 | 2012 |
| Best Answers over Incomplete Data: Complexity and First-Order Rewritings. A Gheerbrant, C Sirangelo IJCAI, 1704-1710, 2019 | 2 | 2019 |
| Complete Axiomatization of the Stutter-Invariant Fragment of the Linear-time mu-calculus A Gheerbrant | 2 | 2010 |
| 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 | | 2013 |
| SOURCE (OR PART OF THE FOLLOWING SOURCE): Type PhD thesis Title Fixed-point logics on trees AP Gheerbrant | | 2010 |
| 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 | | 2006 |
| Incomplete information, monotonicity and homomorphism preservation A Gheerbrant, L Libkin, C Sirangelo | | |
| Querying incomplete graphs with data G Fontaine, A Gheerbrant | | |
Leonid LibkinProfessor of Computer Science, University of EdinburghGeverifieerd e-mailadres voor inf.ed.ac.uk
