The Constraint Satisfaction Problem (CSP) is a good framework for
dealing with combinatorial problems, but it does not take into
account the interactive acquisition of the problem parameters. For
this reason, an extension of the CSP model, the Interactive CSP
model, has been proposed. Various ICSP solving
algorithms have been discussed as well. In order to verify for
which kind of problems the ICSP model is most promising, we
performed a series of systematic tests
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.