A New Method for Solving Constraint Satisfaction Problems

@inproceedings{Seidel1981ANM,
  title={A New Method for Solving Constraint Satisfaction Problems},
  author={Raimund Seidel},
  booktitle={IJCAI},
  year={1981}
}
This paper deals with the combinatorial search problem of f inding values for a set of variables subject to a set of constraints. This problem is referred to as a constraint sat isfact ion problem. We present an algorithm for f inding a l l the solutions of a constraint sat isfact ion problem with worst case time bound 0(m*k ) and space bound 0 (n*k f + 1 ) , where n is the number of variables in the problem, m the number of constraints, k the cardinal i ty of the domain of the variables, and f… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

Similar Papers

Loading similar papers…