Download presentation
Presentation is loading. Please wait.
Published byMagdalen Beasley Modified over 8 years ago
1
Constraint Satisfaction Problems/Programming ZUI 2012/2013
2
Consistency checking in CSP until now – passive checking whether the constraints are satisfied Where? When? Remember the scheme of the algorithm?
3
Consistency checking in CSP until now – passive checking whether the constraints are satisfied Where? When? Remember the scheme of the algorithm?
4
Binary CSP unified structure of CSP instances all constraints are binary can we formalize all CSP problems with binary variables? constraints can be represented as a graph nodes – variables edges – constraints between variables
5
Consistency nodes edges / arcs
6
Consistency nodes unary constraints are reflected in the domain of the variable every value in the domain satisfies all unary constraints edges / arcs directed v i → v j for every x from v i domain there exists a value y from v j domain that satisfies all constraints between v i and v j
7
Arc Consistency make each edge in the graph of constraints consistent do we have some guarantees? What algorithm can we use? AC-1 AC-2 AC-3 …
8
Example scheduling requests to hotel rooms list of requests (# of people, from, to) set of rooms (# of beds) heuristics? MRV, LCV, …
9
Example (2) crosswords, sudoku, … representation? heuristics?
10
Homework assignment 2
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.