Constraint Resolution Theories

Focusing on the finite Constraint Satisfaction Problem (CSP), this work presents a pure logic approach to identifying the simplest solutions. It introduces resolution theories based on constructive logic, utilizing resolution rules to eliminate candidate values for CSP variables. Various families of these theories are defined, each with a unique simplicity measure and a rating system for CSP instances. The book ensures good computational properties through the confluence property and aligns with a structured search method, using Sudoku as a key illustrative example.