scholarly journals Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function

1998 ◽  
pp. 201-210 ◽  
Author(s):  
A. E. Eiben ◽  
J. I. van Hemert ◽  
E. Marchiori ◽  
A. G. Steenbeek
Keyword(s):  
Evolutionary Algorithms ◽  
Constraint Satisfaction ◽  
Fitness Function ◽  
Constraint Satisfaction Problems ◽  
Binary Constraint

STRONG DOMAIN FILTERING CONSISTENCIES FOR NON-BINARY CONSTRAINT SATISFACTION PROBLEMS

2008 ◽  
Vol 17 (05) ◽  
pp. 781-802 ◽  
Author(s):  
KOSTAS STERGIOU
Keyword(s):  
Empirical Study ◽  
Constraint Satisfaction ◽  
Constraint Programming ◽  
Constraint Satisfaction Problems ◽  
Worst Case ◽  
Generic Algorithm ◽  
Binary Constraints ◽  
Binary Constraint

Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Although many such consistencies for binary constraints have been proposed and evaluated, the situation with non-binary constraints is quite different. Only very recently have domain filtering consistencies stronger than GAC started to attract interest. Following this line of research, we define a number of strong domain filtering consistencies for non-binary constraints and theoretically compare their pruning power. We prove that three of these consistencies are equivalent to maxRPC in binary CSPs while another is equivalent to PIC. We also describe a generic algorithm for domain filtering consistencies in non-binary CSPs. We show how this algorithm can be instantiated to enforce some of the proposed consistencies and analyze the worst-case complexities of the resulting algorithms. Finally, we make a preliminary empirical study.

Sign in / Sign up

Export Citation Format

Share Document