What’s Wrong with this Sudoku? Using Constraint Programming to Explain Unsatisfiability
Computers have long been used to quickly solve problems which can be modelled using constraints, like Sudoku, but what if the problem has no solution? An extension to the common functionality of existing constraint solvers can provide an explanation of why a model has no solution, requiring little additional time. While your favourite Sudoku app might already highlight mistakes, this work is general, and can be applied to any problem. This doesn’t just mean games, timetabling is another great example.
Keywords
constraint programming, constraint modelling, boolean satisfiability, SAT, explainable AI, dissertation, Artificial Intelligence
Staff
[Joan Espasa Arxer]{jea20}, [Ruth Hoffmann]{rh347}