A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
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 thatdoi:10.1126/science.297.5582.733c fatcat:iwpnl2igmzbxfn7qxalif66ofq