DYNAMIC BACKJUMPING IN CONSTRAINT SATISFACTION PROBLEM SOLVING

A method of performing constraint satisfaction problem (CSP) solving. The method comprises evaluating the nodes of a CSP tree for a TRUE or FALSE state according to a script, wherein the tree models a CSP problem and the script associates rules and corresponding actions with each tree node. During a step of evaluating a specific node, there is dynamically computed a backjump pointer according to a specific rule associated with the specific node, wherein the value of the computed backjump pointer identifies an ancestor node of the tree. Upon a failure to evaluate the node to a TRUE state, the evaluation is restarted at the ancestor node identified by the backjump pointer.