CSCE 421/821, Fall 2002, Glossary 2.

Distributed:  Thursday, September 12, 2002.
To be returned: Tueday September 17, 2002.
Note: Glossaries are optional.
  1. Complete graph
  2. Completeness (of an algorithm)
  3. Conditionning (in search)
  4. Conjunctive decomposition
  5. Current variable
  6. Disjunctive decomposition
  7. Domain annihilation
  8. Future variable
  9. Look-ahead strategy
  10. Node expansion (in search)
  11. Past  variable
  12. Relation
  13. Soundness (of an algorithm)
  14. Thrashing



choueiry@cse.unl.edu