79 search results - page 8 / 16 » Arc-Consistency and Arc-Consistency Again |
IJCAI
2007
13 years 9 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
AI
2008
Springer
13 years 7 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
CP
2001
Springer
14 years 1 days ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
AAAI
2000
13 years 9 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...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...