CSCE 476/876, Spring 2006, Glossary 7
Assigned: Monday, February 27, 2006.
Due:
Friday, March 10, 2006.
Note: Glossaries are
optional but help you improve your grade. For word definition, do
not limit yourself to AIMA. Check the reference books in the
library and on-line resources.
- Alldiff constraint
- Anytime algorithm
- Arc consistency
- Atmost constraint
- Backjumping
- Backtracking search
- Binary constraint
- Boolean CSPs
- Bounded differences (constraint of)
- Bounds propagation
- Chronological backtracking
- Conflict set
- Conflict-directed backjumping
- Consistent assignment
- Constraint graph
- Constraint hypergraph
- Constraint propagation
- Constraint scope
- Constructive search
- Continuous domains
- Cutset conditioning
- Cycle cutset
- Degree (ordering heuristic)
- Domain (of a variable)
- Domain/degree heuristics (not in textbook)
- Extensively defined constraint (not in textbook)
- Finite domains
- Function (mathematical definition)
- Forward checking
- Global constraint
- Infinite domains
- Intensively defined constraint (not in textbook)
- Instantiated variable
- k-consistency
- Linear constraints
- Linear programming
- Minimum remaining values (a.k.a. least domain variable)
- Min-conflict heuristic
- Node consistency
- Objective function
- Path consistency
- Relation (mathematical definition)
- Size of a CSP
- 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
Berthe Y. Choueiry
choueiry@cse.unl.edu