Glossary 2.
Date: September 1st, 2000.
Terms you should be able to define
-
Back-checking
-
Backtracking (chronological, intelligent)
-
Complete solution (global solution)
-
Completeness (of an algorithm)
-
Consistent solution
-
Expansion (of a node in a tree)
-
Forward checking
-
Instantiated variable
-
Partial solution
-
Pruning
-
Soundness (of an algorithm)
-
Thrashing
choueiry@cse.unl.edu