Constraint Programming

Subject 433-433 (2008)

Note: This is an archived Handbook entry from 2008.Search for this in the current handbook

Credit Points: 12.500
Level: Undergraduate
Dates & Locations:

This subject has the following teaching availabilities in 2008:

Semester 2, - Taught on campus.
Pre-teaching Period Start not applicable
Teaching Period not applicable
Assessment Period End not applicable
Last date to Self-Enrol not applicable
Census Date not applicable
Last date to Withdraw without fail not applicable

Timetable can be viewed here. For information about these dates, click here.
Time Commitment: Contact Hours: Twenty-four hours of lectures, 11 hours of workshops
Total Time Commitment: Not available
Prerequisites: Study at the third-year level in at least four of the following areas: artificial intelligence, computer design, database systems, graphics, interactive system design, networks and communications, operating systems, programming languages, software engineering, and theory of computation.
Corequisites: None
Recommended Background Knowledge: None
Non Allowed Subjects: None
Core Participation Requirements:

For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Student Support and Engagement Policy, academic requirements for this subject are articulated in the Subject Overview, Learning Outcomes, Assessment and Generic Skills sections of this entry.

It is University policy to take all reasonable steps to minimise the impact of disability upon academic study, and reasonable adjustments will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact on meeting the requirements of this subject are encouraged to discuss this matter with a Faculty Student Adviser and Student Equity and Disability Support:

Subject Overview:

Constraint Programming is used to solve constraint satisfaction problems such as scheduling and allocation, which are of vital importance to modern business. Increasingly the discipline is replacing operations research, as a generic approach to solving management decisionn problems.

Topics covered include: constraints - valuations, modelling, constraint satisfactin, Gaussian elimination, Simplex and other constraint solvers; constraint simplification, projection and optimisation; finite constraint domains: constraint satisfaction problems, backtracking solvers, node and arc consistency, bounds consistency, generalised consistency methods; constraint logic programs: user-defined constraints, rules, evaluation, derivation trees, the CLP scheme; simple modelling: choice, iteration, optimisation; using data structures: records, lists, binary trees, hierarchical modelling; search control: rule ordering, literal ordering, redundant constraints, minimisation; programming with finite domain constraints: domains, labelling; advanced programming techniques: combined symbolic and arithmetic reasoning, programming optimisation, negation, dynamic scheduling.

Assessment: Project work during semester expected to take 36 hours (30%) and a 3-hour end of semester written exam (70%). To pass the subject students must obtain at least 50% overall, 15/30 on projects and 35/70 in the examination.
Prescribed Texts: None
Recommended Texts:

Information Not Available

Breadth Options:

This subject is not available as a breadth subject.

Fees Information: Subject EFTSL, Level, Discipline & Census Date
Generic Skills:

Information Not Available


Credit may not be gained for both 433-433 Constraint Programming and 433-633 Constraint Programming.

Related Course(s): Bachelor of Computer Science (Honours)
Bachelor of Engineering (Computer Engineering)
Bachelor of Engineering (Electrical Engineering)
Bachelor of Engineering (Software Engineering)

Download PDF version.