Constraint satisfaction problems (CSPs) provide a versatile framework for modelling complex decision-making tasks where a collection of variables must be allocated values that satisfy specific ...

Constraint satisfaction problems are ubiquitous in many domains. They are typically solved using conventional digital computing architectures that do not reflect the distributed nature of many of ...

If you’ve ever completed a sudoku puzzle, then you’ve completed a constraint satisfaction problem (CSP). This type of problem is defined as a mathematical question where a number of constraints or ...

Ian receives research funding from the EPSRC and the Royal Academy of Engineering. He is Director of the Graduate Academy of the Scottish Informatics and Computer Science Alliance and on the board of ...