A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
Dynamic constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Some applications of graph bandwidth to constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
This paper deals with the combinatorial search problem of finding values for a set of variables subject to a set of constraints. This problem is referred to as a constraint satisfaction problem. We present an algorithm for finding all the solutions of a constraint satisfaction problem with worst case time bound 0(m*kf+1) and space bound 0(n*kf+1), where n is the number of variables in the problem, m the number of constraints, k the cardinality of the domain of the variables, and f