Search
Graph Searching
CSP
Consistency for CSPs
Hill
SLS for CSPs
Deduction
Deduction
Bayes
Belief Networks
DTree
Decision Trees
Neural
Neural
STRIPS to CSP
STRIPS to CSP
CSP
Consistency Based CSP Solver
version 4.6.1
Click here to start the tool using Java Web Start. If you are having problems running the tool, ensure that you have the latest version of Java installed and that it is enabled in your browser. This can be acquired from Sun's Java website.

Description:
Constraint satisfaction problems (CSPs) are pervasive in AI problems. A constraint satisfaction problem is the problem of assigning values to variables that satisfy some constraints. This constraint satisfaction problem solver (arc consistency) tool is designed to help you learn about solving CSPs with a systematic search technique called arc consistency.

Please visit our feedback page and send us your comments about the tools!

This tool was written by Kevin O'Neill, Shinjiro Sueda, Saleema Amershi, Mike Pavlin, Kyle Porter, and Byron Knoll, with help from Leslie Tung, Mike Cline, Holger Hoos, Peter Gorniak, Cristina Conati, Alan Mackworth, and David Poole.

Valid HTML 4.0 Transitional