Many real-life problems are dynamic, with changes in the problem definition occurring after
a solution to the initial formulation has been reached. A minimal perturbation problem …

Constraint Satisfaction Problem (CSP) is a discrete combinatorial problem and hence
search algorithms belong to the main constraint satisfaction techniques. There exist local …

Constraint programming is an efficient and powerful paradigm for solving constraint
satisfaction and optimization problems. Under this paradigm, problems are modeled as a …

Abstract In Constraint Programming, enumeration strategies play an important role, they can
significantly impact the performance of the solving process. However, choosing the right …

In this work we show a framework for guiding the classical constraint programming
resolution process. Such a framework allows one to measure the resolution process state in …

Constraint Programming is a powerful paradigm which allows the resolution of many
complex problems, such as scheduling, planning, and configuration. These problems are …

The main goal concerning Constraint Satisfaction Problems is to determine a value
assignment for variables satisfying a set of constraints, or otherwise, to conclude that such …

Solving constraint satisfaction problems via constraint programming involves the exploration
of a search tree where the potential solutions are distributed. The exploration phase is …

Sažetak The variable and value ordering heuristics are a key element in Constraint
Programming. Known together as the enumeration strategy they may have important …

Constraint programming effectively solves constraint satisfaction and optimization problems
by basically building, pruning, and exploring a search tree of potential solutions. In this …