CSCE 476/876, Fall 2023, Glossary 7
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.
This glossary has two parts. Please start with the introductory terms then move to the more advanced ones.
Introductory
- Alldiff constraint
- Arc consistency
- Atmost constraint (do some research)
- Backtracking search
- Binary constraint
- Boolean CSPs
- Bounded differences (constraint of)
- Chronological backtracking
- Conflict set
- Conflict-directed backjumping
- Consistent assignment
- Constraint arity
- Constraint graph
- Constraint hypergraph
- Constraint propagation
- Constraint scope
- Constructive search
- Continuous domains
- Decision problem
- Degree (of a vertex in a graph)
- Degree heuristic)
- 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)
- Node consistency
- Path consistency
- Relation (mathematical definition)
- Strong k-consistency
- Ternary constraint
- Unary constraint
- Universal constraint
- Variable (of a CSP)
- Variable ordering heuristic
- Value ordering heuristic
Advanced
- Backjumping
- Bounds propagation (do some research)
- Cutset conditioning
- Cycle cutset
- Min-conflict heuristic
- Tree decomposition (of a CSP)
- Tree width of a graph (check a book on graph theory)
- Width of a graph (do some research)
Berthe Y. Choueiry
choueiry@cse.unl.edu