Satisfaction Guaranteed ∗

@inproceedings{Freuder2003SatisfactionG,
  title={Satisfaction Guaranteed ∗},
  author={Eugene C. Freuder and Tom Carchrae and J. Christopher Beck},
  year={2003}
}
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially useful in an interactive context in which different users access the model to make choices on-line, e.g. in e-commerce configuration. The conventional machinery for ensuring backtrack-free search, however, adds additional constraints, which may require an impractical amount of space. A new approach is presented here that… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

Boosting constraint satisfaction using decision trees

16th IEEE International Conference on Tools with Artificial Intelligence • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…