CSCE 476/876, Spring 2004, Glossary 7

Assigned:  Friday, March 12, 2004.
Due:  Monday March 29, 2004.
Note: Glossaries are optional but help you improve your grade. For word definition, do not limit yourself to AIMA. Check the reference books in the library and on-line resources.
  1. Alldiff constraint
  2. Anytime algorithm
  3. Arc consistency
  4. Atmost constraint
  5. Backjumping
  6. Backtracking search
  7. Binary constraint
  8. Boolean CSPs
  9. Bounded differences (constraint of)
  10. Bounds propagation
  11. Chronological backtracking
  12. Conflict set
  13. Conflict-directed backjumping
  14. Consistent assignment
  15. Constraint graph
  16. Constraint hypergraph
  17. Constraint propagation
  18. Constraint scope
  19. Constructive search
  20. Continuous domains
  21. Cutset conditioning
  22. Cycle cutset
  23. Degree (ordering heuristic)
  24. Domain (of a variable)
  25. Domain/degree heuristics (not in textbook)
  26. Extensively defined constraint (not in textbook)
  27. Finite domains
  28. Forward checking
  29. Global constraint
  30. Independent subproblems
  31. Infinite domains
  32. Intensively defined constraint (not in textbook)
  33. Instantiated variable
  34. k-consistency
  35. Linear constraints
  36. Linear programming
  37. Minimum remaining values (a.k.a. least domain variable)
  38. Min-conflict heuristic
  39. Node consistency
  40. Objective function
  41. Path consistency
  42. Size of a CSP
  43. Strong k-consistency
  44. Ternary constraint
  45. Tree decomposition (of a CSP)
  46. Tree width of a graph (check a book on graph theory)
  47. Unary constraint
  48. Universal constraint
  49. Variable (of a CSP)
  50. Variable ordering heuristic
  51. Value ordering heuristic
Berthe Y. Choueiry
choueiry@cse.unl.edu