PhD, Computer Science, University of Toronto
MSc, Computing Science, Simon Fraser University
BSc, Cognitive Science and Artificial Intelligence, University of Toronto
Propositional satisfiability and finite domain constraint satisfaction (and variants and generalizations)
results on the complexity of these problems
aspects of design of practical algorithms for SAT and CSP
application to formal verification and related tasks
I'm especially interested in the applications of results in propositional proof complexity to the design and analysis of search algorithms for SAT and CSP, and in particular for attacking challenging families of application instances.