| Game solution, epistemic dynamics and fixed-point logics J van Benthem, A Gheerbrant Fundamenta Informaticae 100 (1-4), 19-41, 2010 | 56 | 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 | 32 | 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 | 21 | 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 A Gheerbrant University of Amsterdam, 2010 | 13 | 2010 |
| Certain answers over incomplete XML documents: Extending tractability boundary A Gheerbrant, L Libkin Theory of Computing Systems 57, 892-926, 2015 | 10 | 2015 |
| Craig interpolation for linear temporal languages A Gheerbrant, B Ten Cate Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual …, 2009 | 10 | 2009 |
| Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees A Gheerbrant, B ten Cate Logical Foundations of Computer Science: International Symposium, LFCS 2009 …, 2009 | 10 | 2009 |
| Complete axiomatizations of fragments of monadic second-order logic on finite trees A Gheerbrant, B ten Cate Logical Methods in Computer Science 8, 2012 | 8 | 2012 |
| 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 Web Reasoning and Rule Systems: 7th International Conference, RR 2013 …, 2013 | 7 | 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 | 4 | 2019 |
| Complete Axiomatization of the Stutter-Invariant Fragment of the Linear-time mu-calculus A Gheerbrant | 2 | 2010 |
| GPC: A Pattern Calculus for Property Graphs N Francis, A Gheerbrant, P Guagliardo, L Libkin, V Marsault, W Martens, ... arXiv preprint arXiv:2210.16580, 2022 | 1 | 2022 |
| Complete Axiomatizations of MSO, FO (TC1) and FO (LFP1) on finite trees B ten Cate, A Gheerbrant LFCS, 2009 | 1 | 2009 |
| A Researcher's Digest of GQL N Francis, A Gheerbrant, P Guagliardo, L Libkin, V Marsault, W Martens, ... 26th International Conference on Database Theory (ICDT 2023) 255, 2023 | | 2023 |
| Certain Answers of Extensions of Conjunctive Queries by Datalog and First-Order Rewriting A Gheerbrant, L Libkin, A Rogova, C Sirangelo 4th International Workshop on the Resurgence of Datalog in Academia and …, 2022 | | 2022 |
| 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: Essays …, 2013 | | 2013 |
| SOURCE (OR PART OF THE FOLLOWING SOURCE): Type PhD thesis Title Fixed-point logics on trees AP Gheerbrant | | 2010 |
Leonid LibkinProfessor of Computer Science, University of EdinburghVerified email at inf.ed.ac.uk
