Glossary I.

Distributed:  Thursday, August 30, 2001.
To be returned: Tueday September 4, 2001.
Note: Glossaries are optional.
 
  1. 3SAT
  2. Algebraic constraint
  3. Anytime algorithm
  4. Arc-consistency
  5. Back-checking
  6. Binary constraint
  7. Chronological backtracking
  8. Cartesian product
  9. Coloring constraint
  10. Constraint arity
  11. Constraint filtering
  12. Constraint graph
  13. Constraint network
  14. Constraint of bounded differences
  15. Constraint of difference
  16. Constraint scope
  17. Continuous CSP
  18. Decision problem
  19. Finite (discrete) CSP
  20. Forward checking
  21. Global constraint
  22. Instantiated variable
  23. Intelligent backtracking
  24. Macro-structure, micro-structure, co-micro-structure
  25. Map coloring problem
  26. Mutex constraint
  27. NP-completeness
  28. Problem reduction
  29. Product configuration problem
  30. Resource allocation problem
  31. Variable domain
  32. Variable/value ordering heuristic
  33. SAT
  34. Ternary constraint
  35. Tuple
  36. Unary constraint
  37. Universal constraint
  38. VVP

choueiry@cse.unl.edu