Constraint networks: a survey
---

Title: Constraint Networks: A Survey

Section 1: Introduction
Description 1: Introduction to constraint satisfaction problems and an overview of the techniques used to solve them.

Section 2: Constraint Satisfaction Problems
Description 2: Defines what a constraint satisfaction problem (CSP) is and explains the basic concepts.

Section 3: Problem Reduction
Description 3: Discusses the set of techniques aimed at reducing redundant values and compound labels to simplify the problem.

Section 4: Solution Synthesis
Description 4: Explains the process of incrementally building a minimal problem graph and generating legal compound labels.

Section 5: Searching
Description 5: Describes various searching strategies and algorithms used to find solutions to CSPs.

Section 6: Backtracking Algorithm
Description 6: Details the backtracking algorithm and its variants, particularly focusing on the AC-Lookahead algorithm.

Section 7: Truth Maintenance System
Description 7: Analyzes the Truth Maintenance System (TMS) and its variants, highlighting dependency-directed backtracking.

Section 8: Constraint Propagation
Description 8: Examines the technique of maintaining consistency among nodes of a constraint network through constraint propagation.

Section 9: Interval Constraint Satisfaction Problems
Description 9: Introduces interval constraint satisfaction problems (ICSPs) and their specific characteristics.

Section 10: Conclusion
Description 10: Summarizes the survey of constraint satisfaction problems and techniques, breaking them down into problem reduction, solution synthesis, and searching.