In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...