We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
Abstract. Applying GAC on conjunctions of constraints can lead to more powerful pruning [1]. We show that there exists a simple heuristic for deciding which constraints might be us...
The optimal motion generation problem is solved subject to various actuator constraints while the motion is constrained to an arbitrary path. The considered objective function is ...
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...