In this paper, we address the issue of designing from SAT new value ordering heuristics for CSP. We show that using the direct and support SAT encodings of CSP instances, such heuristics can be naturally derived from the well-known two-sided Jeroslow-Wang heuristic. These heuristics exploit the bi-directionality of constraint supports to give a more comprehensive picture in terms of domain redu...

A BFGS method, in association with a new backtracking line search technique, is presented for solving symmetric nonlinear equations. The global and superlinear convergences of the given method are established under mild conditions. Preliminary numerical results show that the proposed method is better than the normal technique for the given problems. c © 2007 Elsevier Ltd. All rights reserved.

A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solution time for this problem, different ordering heuristics were implementented. The results obtained by using these methods are compared on the instances reported in the CSPLib.

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...

We show that parallel search techniques derived from their sequential counterparts can enable the solution of motion planning problems that are computationally impractical on sequential machines. We present a parallel version of a robot motion planning algorithm based on \quasi best rst" search with randomized escape from local minima and random backtracking, and discuss its performance on a va...

Gaschnig's backjumping algorithm has become one of the standard methods for constraint satisfaction, performing dependency-directed backtracking (`backjumping') from nodes which cannot be further expanded during tree search. In this paper, we show how this algorithm can be extended to also permit backjumping from nodes which were expanded, but whose subtrees eventually failed. We experimentally...

Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomization and restarts can dramatically improve the performance of a backtracking algorithm on some instances. We consider the commonly occurring scenario where one is to solve an ensemble of instances using a backtracking algorith...