Foundations of Artificial Intelligence, Vol. 2, Suppl. (C), 2006
Chapter 17 Constraints over Structured Domains
The computer will be the most marvellous of all tools as soon as program writing and debugging will be no longer necessary
—Jean-Louis Laurière (1976)
A wide range of combinatorial search problems find a natural formulation in the language of sets, multisets, strings, functions, graphs or other structured objects. Bin-packing, set partitioning, set covering, combinatorial design problems, circuits and mapping problems are some of them. They are NP-complete problems originating from areas as diverse as combinatorial mathematics, operations research or artificial ...