Glossary I.

Date:  August 30, 2000.
 

Terms you should be able to define:
 

  1. 3SAT
  2. Algebraic constraint
  3. Algebraic constraint
  4. Arc-consistency
  5. Binary constraint
  6. Binary constraint
  7. Cartesian product
  8. Coloring constraint
  9. Constraint arity
  10. Constraint filtering
  11. Constraint graph
  12. Constraint network
  13. Constraint of bounded differences
  14. Constraint of difference
  15. Constraint scope
  16. Continuous CSP
  17. Decision problem
  18. Finite (discrete) CSP
  19. Global constraint
  20. Join in databases
  21. Map coloring problem
  22. Mutex constraint
  23. NP-completeness
  24. Problem reduction
  25. Product configuration problem
  26. Resource allocation problem
  27. SAT
  28. Tuple
  29. Unary constraint
  30. Universal constraint
  31. Variable domain/ Domain of values


choueiry@cse.unl.edu