Transcription of Solving Constraint Satisfaction Problems (CSPs) using Search
{{id}} {{{paragraph}}}
Example: barber
Solving Constraint Satisfaction Problems (CSPs) using Search
Solving Constraint Satisfaction Problems (CSPs) using Search Alan Mackworth UBC CS 322 CSP 2 January 28, 2013 Textbook Lecture Overview Constraint Satisfaction Problems (CSPs): Definition and Recap CSPs: Motivation Solving CSPs - Generate & Test - Graph Search 2 3 Course Overview Environment Problem Type Logic Planning Deterministic Stochastic Constraint Satisfaction Search Arc Consistency Search Search Logics STRIPS Variables + Constraints Variable Elimination Bayesian Networks Decision Networks Markov Processes Static Sequential Representation Reasoning Technique Uncertainty Decision Theory Course Module Variable Elimination Value Iteration Planning Now focus on CSPs Standard Search vs.
• Sudoku – variables are cells – domain of each variable is {1,2,3,4,5,6,7,8,9} ... 16 . Constraint Satisfaction Problems: Variants • We may want to solve the following problems with a CSP: – determine whether or not a model exists – find a model
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: