Constraint programming offers facilities for problem modelling, constraint propagation and
search. This paper discusses the resulting benefits for practical applications which exploit …

The constraint satisfaction community has developed a number of heuristics for variable
ordering during backtracking search. For example, in conjunction with algorithms which …

A timetabling problem can be defined as the scheduling of a certain number of lectures,
which are to be attended by a specific group of students and given by a teacher, over a …

A brief overview of over-constrained systems | SpringerLink Skip to main content Advertisement
Springer Nature Link Account Menu Find a journal Publish with us Track your research Search …

Model transformation has proven to be an effective technique to produce target models from
source models. Most transformation approaches focus on generating a single target model …

This volume presents a collection of refereed papers reflecting the state of the art in the area
of over-constrained systems. Besides 11 revised full papers, selected from the 24 …

This paper presents a defeasible constraint solver for the domain of linear equations,
disequations and inequalities over the body of rational/real numbers. As extra requirements …

Abstract In many Constraint Logic Programming (CLP) applications one needs to express
not only strict requirements but also preferences. Constraint hierarchies are one way of …

Abstract Many real-life Constraint Satisfaction Problems are over constrained. In order to
provide some kind of solution for such problems, this paper proposes a constraint relaxation …

Abstract Hierarchical Constraint Solving has been proposed as an adequate scheme to
specify over-constrained problems where some of the constraints might remain unsatisfied …