CSCE 990-06 Advanced Constraint Processing, Spring 2003

Glossary 2 as Homework 2, worth 28 points

Assigned:  Monday, Feb. 17, 2003.
Due:         Wednesday Feb. 19, 2003.
Note: it would be a good idea to sort the list alphabetically.

1. Knowledge acquisition
2. Width of an ordering
3. Width of a graph
4. Induced graph
5. Induced width of an ordering
6. Induced width of a graph
7. Compare MW to MIW
8. Inference
9. Induced width of chordal graphs
10. Bucket: how to build it, what it contains
11. Bucket elimination: what does it correspond to doing?
12. Adaptive consistency
13. Consistent network
14. w*-based tractability

Do not forget to list your references.

---

choueiry@cse.unl.edu