Lecture-09-Constraint_Satisfaction

Lecture-09-Constraint_Satisfaction - CS 561: Artificial...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 561: Artificial Intelligence Instructor: Sofus A. Macskassy, macskass@usc.edu TA: Harris Chiu ( chichiu@usc.edu ), Wed 2:45-4:45pm, PHE 328 Penny Pan ( beipan@usc.edu ), Fri 10am-noon, PHE 328 Lectures: MW 5:00-6:20pm, ZHS 159 Office hours: By appointment Class page: http://www-rcf.usc.edu/~macskass/CS561-Fall2010/ This class will use https://blackboard.usc.edu/webapps/login/ and class webpage - Up to date information - Lecture notes - Relevant dates, links, etc. Course material: [AIMA] Artificial Intelligence: A Modern Approach, by Stuart Russell and Peter Norvig. (3rd ed)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS561 - Lecture 9 - Macskassy - Fall 2010 2 Constraint Satisfaction [AIMA Ch 6] CSP examples Backtracking search for CSPs Problem structure and problem decomposition Local search for CSPs
Background image of page 2
Standard search problems: State is a “black box”: arbitrary data structure Goal test: any function over states Successor function can be anything Constraint satisfaction problems (CSPs): A special subset of search problems State is defined by variables X i with values from a domain D (sometimes D depends on i ) 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 Constraint satisfaction problems (CSPs) 3 CS561 - Lecture 9 - Macskassy - Fall 2010
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example: N-Queens Formulation 1: Variables: Domains: Constraints 4 CS561 - Lecture 9 - Macskassy - Fall 2010
Background image of page 4
Example: N-Queens Formulation 2: Variables: Domains: Constraints: Implicit: Explicit: -or- 5 CS561 - Lecture 9 - Macskassy - Fall 2010
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS561 - Lecture 9 - Macskassy - Fall 2010 6 Example: Map-Coloring
Background image of page 6
CS561 - Lecture 9 - Macskassy - Fall 2010 7 Example: Map-Coloring contd.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS561 - Lecture 9 - Macskassy - Fall 2010 8 Constraint graph Binary CSP : each constraint relates at most two variables Constraint graph : nodes are variables, arcs show constraints General-purpose CSP algorithms use the graph structure to speed up search. E.g., Tasmania is an independent subproblem!
Background image of page 8
CS561 - Lecture 9 - Macskassy - Fall 2010 9 Example: Cryptarithmetic Variables: F T U W R O X1 X2 X3 Domains: { 0 ; 1 ; 2 ; 3 ; 4 ; 5 ; 6 ; 7 ; 8 ; 9 } Constraints alldiff ( F; T;U;W;R;O ) O + O = R + 10 · X1 X1 + W + W = U + 10 · X2 X2 + T + T = O + 10 · X3 X3 = F Every higher-order finite constraint can be broken into n binary constraints, given enough auxiliary constraints
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example: Sudoku Variables: Each (open) square Domains: {1,2,…,9} Constraints: 9-way alldiff for each row 9-way alldiff for each column 9-way alldiff for each region 10 CS561 - Lecture 9 - Macskassy - Fall 2010
Background image of page 10
Example: Boolean Satisfiability Given a Boolean expression, is it satisfiable? Very basic problem in computer science
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 42

Lecture-09-Constraint_Satisfaction - CS 561: Artificial...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online