Glossary I.
Date: August 30, 2000.
Terms you should be able to define:
-
3SAT
-
Algebraic constraint
-
Algebraic constraint
-
Arc-consistency
-
Binary constraint
-
Binary constraint
-
Cartesian product
-
Coloring constraint
-
Constraint arity
-
Constraint filtering
-
Constraint graph
-
Constraint network
-
Constraint of bounded differences
-
Constraint of difference
-
Constraint scope
-
Continuous CSP
-
Decision problem
-
Finite (discrete) CSP
-
Global constraint
-
Join in databases
-
Map coloring problem
-
Mutex constraint
-
NP-completeness
-
Problem reduction
-
Product configuration problem
-
Resource allocation problem
-
SAT
-
Tuple
-
Unary constraint
-
Universal constraint
-
Variable domain/ Domain of values
choueiry@cse.unl.edu