7 search results - page 1 / 2 » Binary vs. non-binary constraints |
AAAI
1998
13 years 6 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
AAAI
2000
13 years 6 months ago
2000
We perform an extensive theoretical and empirical analysis of the use of auxiliary variables and implied constraints in modelling a class of non-binary constraint satisfaction pro...
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
We present a detailed study of two inverse consistencies for non-binary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These ar...
ICTAI
2007
IEEE
13 years 11 months ago
2007
IEEE
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Alt...
ECAI
1992
Springer
13 years 8 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...