CSCE 421/821, Fall 2002, Glossary 1

Assigned:  Thursday, September 5, 2001.
Due: Thursday September 12, 2001.
Note: Glossaries are optional.
  1. 3SAT, SAT
  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 graph
  12. Constraint network
  13. Constraint of bounded differences
  14. Constraint of difference
  15. Constraint scope
  16. Continuous CSP (a.k.a. numeric CSP)
  17. Decision problem
  18. Finite (discrete) CSP
  19. Forward checking
  20. Global constraint
  21. Instantiated variable
  22. Intelligent backtracking
  23. Iterative repair (a.k.a. local search)
  24. Macro-structure, micro-structure, co-micro-structure (3 points)
  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. Systematic search (a.k.a. constructive, exhaustive)
  34. Ternary constraint
  35. Tuple
  36. Unary constraint
  37. Universal constraint
  38. Variable-value ordering heuristic
  39. Variable-value pair (VVP)

choueiry@cse.unl.edu