My main research interests are:

  • Boolean Satisfiability (SAT)
  • Satisfiability Modulo Theories (SMT)
  • Classical and Numeric AI Planning
  • Planning as Satisfiability
  • Constraint Programming
  • Automated reformulation of models
  • Formal Languages and their expressivity
  • Applications of Logic to Computer Science

Projects:

  • RanTanPlan, a numeric planner as satisfiability
  • Demystify, a tool to explain how to solve a pen and paper puzzle step by step via minimal unsatisfiable sets.