Interchangeability provides a principled approach to abstraction and reformulation of constraint satisfaction problems. Values are interchangeable if exchanging one for the other in any solution produces another solution. Abstracting a problem by simplifying the constraints can increase interchangeability. Multi-dimensional constraint satisfaction problems can provide natural opportunities for ...

Cooperative constraint solving is an area of constraint programming that studies the interaction between constraint solvers with the aim of discovering the interaction patterns that amplify the positive qualities of individual solvers. Automatisation and formalisation of such studies is an important issue of cooperative constraint solving. In this paper we present a constraint-based analysis of...

We study the equilibrium states for an energy functional with a parametric force field on a region of a surface. Consideration of free equilibrium states is based on Lyusternik - Schnirelman's and Skrypnik's variational methods. Consideration of equilibrium states under a constraint of geometrical character is based on an analog of Skrypnik's method, described in [P. Vyridis, {it Bifurcation in...

We present a survey of complexity results for hybrid constraint satisfaction problems (CSPs) and valued constraint satisfaction problems (VCSPs). These are classes of (V)CSPs defined by restrictions that are not exclusively language-based or structure-based. 1998 ACM Subject Classification F.4.1 Mathematical Logic, G.2.1 Combinatorics, G.2.2 Graph Theory, F.1.3 Complexity Measures and Classes, ...

Combining machine learning [13, 16] and constraint satisfaction techniques is attracting considerable attention from a variety of researchers in the constraints community. In this talk we will review several examples of how techniques from the field of machine learning can be successfully exploited in the domain of constraint satisfaction. In particular, we will consider how we can exploit mach...

Selecting and arranging parts is the core of a configuration task. The validity of a configuration is defined in terms of constraints. Highly declarative, domain independent and simple to use, the constraint satisfaction problem (CSP) paradigm offers an adequate framework for this task. However, the basic paradigm is not powerful enough to capture or to take advantage of essential aspects of co...

We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a single primitive constraint which allows the boolean solver to be encoded at a low-level. The boolean solver obtained in this way is both very simple and very efficient: on average it is eight times faster than the CHIP pro...

in this paper, based on the background of cost-oriented assembly line balancing problems, a novel mathematical model for scheduling and balancing the assembly line is offered that with the combination of task sequence-dependent setup time, parallel stations and resource constraint, minimizes the operational and investment costs of assembly system. due to the complexity of the problem, the equat...