346 search results - page 2 / 70 » Solving quantified constraint satisfaction problems |
CP
2005
Springer
13 years 10 months ago
2005
Springer
IJCAI
1993
13 years 5 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
AAAI
2004
13 years 5 months ago
2004
The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce two concepts, which are inspired by consistency, for the more general framewor...
CSL
2006
Springer
13 years 8 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
PPSN
1998
Springer
13 years 8 months ago
1998
Springer
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...