•Standard search problem:
–state is a "black box“ – any data structure that supports successor function, heuristic function, and goal test
•CSP:
–state is defined by variables Xi with values from domain Di
–goal test is a set of constraints specifying allowable combinations of values for subsets of variables
•Simple example of a formal representation language
•Allows useful general-purpose algorithms with more power than standard search algorithms
No comments:
Post a Comment