1 / 16

Initial domains (domain consistent) 1A: { ant big bus car has }

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. D omains 1A: { ant big bus car has }

ceana
Download Presentation

Initial domains (domain consistent) 1A: { ant big bus car has }

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. 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

  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]), . . .

  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]), . . . No change

  5. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 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

  6. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 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

  7. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 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

  8. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 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

  9. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 2D: { symbol syntax ginger search } 3A: { bookbuyshold 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 reactivate

  10. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 2D: { symbolsyntax ginger search} 3A: { bookbuyshold 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]))

  11. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 2D: { symbolsyntax ginger search} 3A: { bookbuyshold 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 No change

  12. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 2D: { symbolsyntax ginger search} 3A: { bookbuyshold lane year} 4A: { ant bigbus 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

  13. Domains 1A: { antbig bus car has } 1D: { book buys hold laneyear } 2D: { symbolsyntax ginger search} 3A: { bookbuyshold lane year} 4A: { ant bigbus 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 No change No change No change No change

  14. 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])) final result of GAC alg Start with this to get final solutions to the constraint satisfaction problem TDA is empty

  15. Domains 1A: { bus has } 1D: { buys hold } 2D: { syntax search } 3A: { lane year } 4A: { ant car } b u s u e y e a r One solution r s c a r h

More Related