A general approach to implement propagation and simplification of constraints consists of applying rules over these constraints. Recently, several proposals have been made to solve finite constraint satisfaction probl...
详细信息
ISBN:
(纸本)158113388X
A general approach to implement propagation and simplification of constraints consists of applying rules over these constraints. Recently, several proposals have been made to solve finite constraint satisfaction problems by means of automatically generated propagation rules [4, 9, 3]. Since propagation rules do not rewrite constraints but add new ones, the constraint store may contain superfluous constraints. Removing these constraints not only allows saving of space but also decreases the cost of constraint solving. constraints can be removed using simplification rules. In this paper, we present a method to transform propagation rules into simplification rules using the concept of confluence. the generated rules are implemented in the language constraint Handling Rules (CHR). An example taken from the field of digital circuit design shows that our approach is of practical use.
We introduce a new global constraint for modeling and solving network flow problems in constraintprogramming. We describe the declarative and operational semantics of the flow constraint and illustrate its use throug...
详细信息
the tcc model is a formalism for reactive concurrent constraintprogramming. In this paper we propose a model of temporal concurrent constraintprogramming which adds to tcc the capability of modeling asynchronous and...
详细信息
this paper presents some lessons that can be drawn, from the point of view of the constraint reasoning and constraintprogramming community, from trying to model and to solve as best as possible the mission management...
详细信息
In this paper we show, for the specific problem of test pattern optimisation, that adapting constraint propagation with results obtained from local search outperforms the use of each of these techniques alone. We show...
详细信息
Although constraintprogramming offers a wealth of strong, general-purpose methods, in practice a complex, real application demands a person who selects, combines, and refines various available techniques for constrai...
详细信息
While there are many AI algorithms designed for finding solutions in a constraint Satisfaction Problems, finding similar solutions of a CSP requires entirely new and different methods. the method we propose here is ba...
详细信息
We present Branch-and-Check, a hybrid framework integrating Mixed Integer programming and constraint Logic programming, which encapsulates the traditional Benders Decomposition and Branch-and-Bound as special cases. I...
详细信息
Very efficient solvers for Integer programming exist, when the constraints and the objective function are linear. In this paper we tackle a fundamental question: what is the expressive power of Integer Linear Programm...
详细信息
the modelling process of constraint satisfaction problems as constraint programs requires sophisticated reasoning skills and involves crucial decisions on which variable representations to choose, on which constraint ...
ISBN:
(纸本)3540428631
the modelling process of constraint satisfaction problems as constraint programs requires sophisticated reasoning skills and involves crucial decisions on which variable representations to choose, on which constraint formulation to state, and on which solution methods to employ. Furthermore, the tight interaction between representation, constraint formulation, and solution methods adds another degree of complexity to the modelling task. For instance, the choice of the constraint formulation is strongly affected by the choice of the representation of variables and values, and by the choice of the solution methods. In addition, the performance of solution methods is sensitive to the problem instances. thus, modelling combinatorial optimisation problems so as to solve them in more efficient ways is a major challenge for constraintprogramming.
暂无评论