Tag: Academic

General Definitions arc consistency The domains of a variable Vi is such that for each constraint Ci,j Vi is consistent with the constraint for some permissible value of Vj for every value in the domain of Vi That is for every value x in Di (the domain of i) there exists some y in Dj such that Ci,j is satisfied.

The binary constraint satisfaction problem (bcsp) is an important area of research because so many problems can be represented in this form [Kumar92].

This section contains pseudocode of the algorithms used in the paper as well as a brief discussion of each algorithm.

This section outlines the algorithms used to generate the problems the various solving algorithms were tested against.

Conclusions regarding selected algorithms against the Sherlock and Zebra problems.

Bibliography and appendices for selected algorithms against the Zebra and Sherlock problems