Solving constraint satisfaction problems I: Logic problems
This is a program for solving or partially solving a class of Constraint Satisfaction Problems (CSPs). Specifically, this program works on CSPs that can be stated in terms of finding an equivalence relation on a finite set, given that the user can specify a partition of the set into Systems of Distinct Representatives (SDRs) of the equivalence classes. In the examples that follow, we will see that many CSPs that do not at first appear to be in this form can be readily put into this form. In particular, many problems that appear in puzzle magazines as "Logic Problems" can be stated in this form.
