CSCE 421/821: Foundations of Constraint Processing

Prereqs: CSCE 235; CSCE 310 or CSCE 311.
Constraint processing for articulating and solving industrial problems such as design, scheduling, and resource allocation. The foundations of constraint satisfaction, its basic mechanisms (e.g., search, backtracking, and consistency-checking algorithms), and constraint programming languages. New directions in the field, such as strategies for decomposition and for symmetry identification.
Credit Hours: 3
Course Format: Lecture 3
Course Delivery: Classroom

Attention

This is the site for old bulletin data. Please head to UNL's Course Catalog for updated course and program information.