Download presentation
Presentation is loading. Please wait.
2
Initial domains (domain consistent) 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax search ginger } 3A: { book buys hold lane year} 4A: { ant big bus car has } beast
3
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),... What are implications of constraint on 1A
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...](http://images.slideplayer.com/33/10102537/slides/slide_3.jpg "What are implications of constraint on 1A.")
4
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...](http://images.slideplayer.com/33/10102537/slides/slide_4.jpg "Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...")
5
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),... No change
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...](http://images.slideplayer.com/33/10102537/slides/slide_5.jpg "No change.")
6
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),... 1D changed, so reactivate
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...](http://images.slideplayer.com/33/10102537/slides/slide_6.jpg "1D changed, so reactivate.")
7
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),... reactivate
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...](http://images.slideplayer.com/33/10102537/slides/slide_7.jpg "reactivate.")
8
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),... No change
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...](http://images.slideplayer.com/33/10102537/slides/slide_8.jpg "No change.")
9
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),... already active
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...](http://images.slideplayer.com/33/10102537/slides/slide_9.jpg "already active.")
10
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),... reactivate
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search } 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]),...](http://images.slideplayer.com/33/10102537/slides/slide_10.jpg "reactivate.")
11
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]) (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1]))
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]) (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1]))](http://images.slideplayer.com/33/10102537/slides/slide_11.jpg "Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]) (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1]))")
12
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) No change
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) No change](http://images.slideplayer.com/33/10102537/slides/slide_12.jpg "Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) No change")
13
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) reactivate
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) reactivate](http://images.slideplayer.com/33/10102537/slides/slide_13.jpg "Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) reactivate")
14
Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) No change
![Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) No change](http://images.slideplayer.com/33/10102537/slides/slide_14.jpg "Domains 1A: { ant big bus car has } 1D: { book buys hold lane year } 2D: { symbol syntax ginger search} 3A: { book buys hold lane year} 4A: { ant big bus car has } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) No change")
15
Domains 1A: { bus has } 1D: { buys hold } 2D: { syntax search } 3A: { lane year } 4A: { ant car } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) TDA is empty final result of GAC alg Start with this to get final solutions to the constraint satisfaction problem
![Domains 1A: { bus has } 1D: { buys hold } 2D: { syntax search } 3A: { lane year } 4A: { ant car } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) TDA is empty final result of GAC alg Start with this to get final solutions to the constraint satisfaction problem](http://images.slideplayer.com/33/10102537/slides/slide_15.jpg "Domains 1A: { bus has } 1D: { buys hold } 2D: { syntax search } 3A: { lane year } 4A: { ant car } TDA = { (1A, 1A[1] = 1D[1]), (1A, 1A[3] = 2D[1]), (1D, 1D[3] = 3A[1]), (2D, 2D[3] = 3A[3]), (1D, 1A[1] = 1D[1]), (2D, 1A[3] = 2D[1]), (3A, 1D[3] = 3A[1]), (3A, 2D[3] = 3A[3]), (2D, 2D[5] = 4A[1]) (4A, 2D[5] = 4A[1])) TDA is empty final result of GAC alg Start with this to get final solutions to the constraint satisfaction problem")
16
Domains 1A: { bus has } 1D: { buys hold } 2D: { syntax search } 3A: { lane year } 4A: { ant car } b u s y e a r c a r ue r h s One solution
Similar presentations
