foundations of constraint processing, fall 2012 odds and ends: modeling examples & graphical...
DESCRIPTION
Foundations of Constraint Processing, Fall 2012 Minesweeper Variables? Domains? Constraints? Odds & Ends3Sep 21, 2011TRANSCRIPT
![Page 1: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/1.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 1
Odds and Ends:Modeling Examples & Graphical Representations
Foundations of Constraint Processing
CSCE421/821, Fall 2012 www.cse.unl.edu/~choueiry/F12-421-821/
Berthe Y. Choueiry (Shu-we-ri)Avery Hall, Room 360Tel: +1(402)472-5444
Sep 21, 2011
![Page 2: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/2.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 2
Outline
• Modeling examples– Minesweeper, Game of Set
• Graphical representations
Sep 21, 2011
![Page 3: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/3.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 3
Minesweeper
• Variables?• Domains?• Constraints?
Sep 21, 2011
![Page 4: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/4.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 4
Minesweeper as a CSP demo• Variables are the cells• Domains are {0,1} (i.e., safe or mined)• One constraint for each cell with a number (arity 1...8)
Exactly two mines:000001100001010000110, etc.
Exactly three mines:000011100011010001110, etc.
Joint work with R. Woodward, K. Bayer & J. Snyder
Sep 21, 2011
![Page 5: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/5.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 5
Game of Set [Falco 74]
Joint work with Amanda Swearngin and Eugene C. Freuder
• Deck of 81(=34) cards, each card with a unique combination of 4 attributes values1. Number {1,2,3}2. Color {green,purple,red}3. Filling {empty,stripes, full}4. Shape {diamond,squiggle,oval}
• Solution set: 3 cards attribute, the 3 cards have either the same value or all different values
• 12 cards are dealt, on table [3,21]• Recreational game, favorite of
children & CS/Math students• New toy problem for AI: a typical
multi-dimensional CSP
Sep 21, 2011
![Page 6: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/6.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 6
Set: Constraint Model I
• Model I– Three variables– Same domain (12 cards)– One ‘physical’ constraints– Four 1-dimensional constraints
• Size of model?
c1,c2,c3,…,c12
C=⊕C≠
F=⊕F≠
S=⊕S≠
N=⊕N≠
id≠
c1,c2,c3,…,c12
c1,c2,c3,…,c12
c1 c2 c3
c4 c5 c6
c7 c8 c9
Sep 21, 2011
![Page 7: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/7.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 7
Set: Constraint Model II
• Model II– 12 variables (as many as on table)– Boolean domains {0,1}– Constraints: much harder to express
• Exactly 3 cards: Sum(assigned values)=3?• AllEqual/AllDiff constraints?
• Size of model?
Sep 21, 2011
![Page 8: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/8.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 8
Graphical Representations
• Always specify V,E for a graph as G=(V,E)• Main representations
– Binary CSPs• Graph (for binary CSPs)• Microstructure (supports)• Co-microstructure (conflicts)
– Non-binary CSPs• Hypergraph• Primal graph
– Dual graph
Sep 21, 2011
![Page 9: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/9.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 9
Binary CSPsMacrostructure G(P)=(V,E)• V=• E=
Micro-structure (P)=(V,E)• V=• E=
Co-microstructure co-(P)=(V,E)• V=• E=
a, b
a, c b, c
V1
V2 V3
(V1, a ) (V1, b)
(V2, a ) (V2, c) (V3, b ) (V3, c)
(V1, a ) (V1, b)
(V2, a ) (V2, c) (V3, b ) (V3, c)
No goods
Supports
Sep 21, 2011
![Page 10: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/10.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 10
Non-binary CSPs: Hypergraph
• Hypergraph (non-binary CSP)– V=– E=
R3
AB
C D
E
F
R1
R4R2 R5
R6
R3
AB
C
DE
FR1
R4
R2 R5
R6
Sep 21, 2011
![Page 11: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/11.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 11
Non-binary CSPs: Primal Graph
• Primal graph– V=– E=
R3
AB
C D
E
F
R1
R4R2 R5
R6 AB
C D
E
F
Sep 21, 2011
![Page 12: Foundations of Constraint Processing, Fall 2012 Odds and Ends: Modeling Examples & Graphical Representations 1Odds & Ends Foundations of Constraint Processing](https://reader036.vdocuments.us/reader036/viewer/2022082510/5a4d1b0a7f8b9ab059989ef3/html5/thumbnails/12.jpg)
Foundations of Constraint Processing, Fall 2012
Odds & Ends 12
Dual Graph
• V=• G=
R4
BCD
ABDE
CF
EFAB
R3 R1
R2
C
F
E
BD
AB
DADA AD B
R5
R6R3
AB
C D
E
F
R1
R4
R2 R5
R6
Hypergraph Dual graph
Sep 21, 2011