CSCE 476/876, Spring 2016, Glossary 7

Assigned:  Friday, Mar 4, 2016.
Due:   Monday, Mar 14, 2016.
Note: Glossaries are optional but help you improve your grade. Clearly acknowledge your sources (textbook, slides, etc.) or no credit will be given. You are not allowed to cut and paste from any source.
  1. Alldiff constraint
  2. Arc consistency
  3. Atmost constraint (do some research)
  4. Backjumping
  5. Backtracking search
  6. Binary constraint
  7. Boolean CSPs
  8. Bounded differences (constraint of)
  9. Bounds propagation (do some research)
  10. Chronological backtracking
  11. Conflict set
  12. Conflict-directed backjumping
  13. Consistent assignment
  14. Constraint arity
  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
  24. Domain (of a variable)
  25. Domain/degree heuristics (not in textbook, do some research)
  26. Extension (definition of a constraint, not in textbook)
  27. Finite domains
  28. Function (mathematical definition)
  29. Forward checking
  30. Global constraint
  31. Intension (constraint defined in intension, not in textbook)
  32. Instantiated variable
  33. k-consistency
  34. Linear constraints
  35. Linear programming (check CS dictionary/web)
  36. Minimum remaining values (a.k.a. least domain variable)
  37. Min-conflict heuristic
  38. Node consistency
  39. Path consistency
  40. Relation (mathematical definition)
  41. Strong k-consistency
  42. Ternary constraint
  43. Tree decomposition (of a CSP)
  44. Tree width of a graph (check a book on graph theory)
  45. Unary constraint
  46. Universal constraint
  47. Variable (of a CSP)
  48. Variable ordering heuristic
  49. Value ordering heuristic
  50. Width of a graph (do some research)
Berthe Y. Choueiry
choueiry@cse.unl.edu