Dynamic Flexible Constraint Satisfaction and its Application to AI Planning

Acknowledging the contributions of supervisors and family, the book delves into the intricacies of Constraint Satisfaction Problems (CSPs). It covers classical CSPs, their applications, and limitations, introducing concepts such as Flexible CSPs and Dynamic CSPs. The structure includes a thorough examination of constraints, constraint graphs, and various solution techniques like backtracking and conflict-directed approaches. The work is supported by an EPSRC studentship, highlighting its academic significance and the collaborative effort behind its development.