The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...