I am a Research Software Development Engineer in the Constraint Reasoning Group at Microsoft Research, Cambridge.

Slides from a course on SAT for CP people at the Third international Summer School on Constraint Programming: part I (ppt and pptx); part II (ppt and pptx).

Slides from a talk at the doctoral programme of the CP 07 conference (pdf and pptx) on "Surviving the PhD (my 2 cents)".

An Analysis of Slow Convergence In Interval Propagation (CP 07 short, 8-page paper). Written jointly with Youssef Hamadi and Moshe Vardi, shows that the problems of slow convergence, that plagues the use of interval propagation methods for large domains, can be explained by an NP-completeness result. An unabridged version with proofs is here. (if you just want to read one page about it see the following colourful poster in pdf and pptx!)

Generalizing Consistency and other Constraint Properties to Quantified Constraints (submitted to a journal; also available through arxiv.org). Written jointly with Marco Cadoli and Toni Mancini, shows how to adapt some usual CSP notions like consistency and interchangeability to quantified constraints.

On the Stochastic Constraint Satisfaction Framework, (SAC 2007). Written jointly with Horst Samulowitz, discusses a number of issues that arise in decision-making with uncertain quantities such as "the number of copies we'll sell over the next week" or "the time it will take to complete the task".

A solver for Quantified Boolean and Linear Constraints, (SAC 2007). Written jointly with Lintao Zhang, proposes a symmetric treatment of universal and existential quantifiers and describes an algorithm for solving quantified Boolean and linear constraints ("bounded" Presburger Arithmetics).

Propositional Satisfiability and Constraint Programming: A Comparative Survey, (ACM Computing Surveys, 2006). Written jointly with Youssef Hamadi and Lintao Zhang, gives an introduction to these two approaches to problem solving, and discusses their respective strenghts. (preprint, version edited by ACM)