CSCE 476/876, Fall 2020, Glossary 7
Assigned: Monday, Oct 5, 2020.
Due: Monday, Oct 12, 2020.
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.
- Alldiff constraint
- Arc consistency
- Atmost constraint (do some research)
- Backjumping
- Backtracking search
- Binary constraint
- Boolean CSPs
- Bounded differences (constraint of)
- Bounds propagation (do some research)
- Chronological backtracking
- Conflict set
- Conflict-directed backjumping
- Consistent assignment
- Constraint arity
- Constraint graph
- Constraint hypergraph
- Constraint propagation
- Constraint scope
- Constructive search
- Continuous domains
- Cutset conditioning
- Cycle cutset
- Degree
- Domain (of a variable)
- Domain/degree heuristics (not in textbook, do some research)
- Extension (definition of a constraint, not in textbook)
- Finite domains
- Function (mathematical definition)
- Forward checking
- Global constraint
- Intension (constraint defined in intension, not in textbook)
- Instantiated variable
- k-consistency
- Linear constraints
- Linear programming (check CS dictionary/web)
- Minimum remaining values (a.k.a. least domain variable)
- Min-conflict heuristic
- Node consistency
- Path consistency
- Relation (mathematical definition)
- Strong k-consistency
- Ternary constraint
- Tree decomposition (of a CSP)
- Tree width of a graph (check a book on graph theory)
- Unary constraint
- Universal constraint
- Variable (of a CSP)
- Variable ordering heuristic
- Value ordering heuristic
- Width of a graph (do some research)
Berthe Y. Choueiry
choueiry@cse.unl.edu