I am a lecturer (equiv. to assistant professor) and member of the Reasoning and Planning Group at King's College London. Before that, I was a post-doc in the Chair for Logic and Verification at Technische Universität München, where I am still a guest researcher and a regular visitor. I was awarded my PhD from the Australian National University, and, before that, an MSc from Cairo University. I also held full-time industry R&D positions from 2009 to 2013 in electronics CAD software and FPGA system design.
Formalising mathematics in Isabelle/HOL. E.g.
Matching algorithms, like Edmonds' Blossom Algorithm and the Micali-Vazirani algorithm for maximum matching.
Graph algorithms, like approximating graph eccentricities.
Different variants of Stokes' theorem.
Modelling computation and complexity theory, like the Cook-Levin theorem.
Formal verification of AI algorithms and systems using interactive theorem provers. E.g.
A formally verified SAT-based planner in Isabelle/HOL.
Formalised the semantics of PDDL in Isabelle/HOL, and building a plan validator based on that.
Verification of diameter upper bounding and symmetry breaking algorithms in HOL4.
Algorithms for classical AI planning and graph theoretic problems defined on state spaces. E.g.
Computing upper bounds on state space diameters.
Exploiting symmetries for more effective reachability algorithms.
There is a fully-funded PhD that is not tied to a specific topic. Please contact me if you want to apply to that. I expect you to have taken a look into my publications and these project themes, and to have made-up your mind as to what themes you find interesting. Then we could come-up with a more concrete topic.
If you are in London or in Munich, and want to do a Bachelor or a Master thesis with me, please take a look into these themes and let me know what you find interesting. Then we could come-up with a more concrete topic.