| Game solution, epistemic dynamics and fixed-point logics J van Benthem, A Gheerbrant Fundamenta Informaticae 100 (1-4), 19-41, 2010 | 59 | 2010 |
| A Researcher’s Digest of GQL N Francis, A Gheerbrant, P Guagliardo, L Libkin, V Marsault, W Martens, ... The 26th International Conference on Database Theory, 2023, 1: 1-1: 22, 2023 | 36 | 2023 |
| 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 | 35 | 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 | 18 | 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 |
| GPC: A pattern calculus for property graphs N Francis, A Gheerbrant, P Guagliardo, L Libkin, V Marsault, W Martens, ... Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2023 | 13 | 2023 |
| 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 | 12 | 2015 |
| Craig interpolation for linear temporal languages A Gheerbrant, B Ten Cate International Workshop on Computer Science Logic, 287-301, 2009 | 11 | 2009 |
| Complete Axiomatizations of MSO, FO(TC1) and FO(LFP1) on Finite Trees A Gheerbrant, B ten Cate International Symposium on Logical Foundations of Computer Science, 180-196, 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 International Conference on Web Reasoning and Rule Systems, 4-18, 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 | 6 | 2019 |
| Complete Axiomatization of the Stutter-Invariant Fragment of the Linear-time mu-calculus A Gheerbrant | 2 | 2010 |
| 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 | 1 | 2022 |
| Complete Axiomatizations of MSO, FO (TC1) and FO (LFP1) on finite trees B ten Cate, A Gheerbrant LFCS, 2009 | 1 | 2009 |
| GQL and SQL/PGQ: Theoretical Models and Expressive Power A Gheerbrant, L Libkin, L Peterfreund, A Rogova arXiv preprint arXiv:2409.01102, 2024 | | 2024 |
| Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings A Gheerbrant, L Libkin, A Rogova, C Sirangelo Theory and Practice of Logic Programming 24 (2), 279-309, 2024 | | 2024 |
Leonid LibkinProfessor of Computer Science, University of EdinburghVerified email at inf.ed.ac.uk
