Results 1  10
of
26
Effective Compilation of Constraint Models
, 2010
"... Constraint Programming is a powerful technique for solving largescale combinatorial (optimisation) problems. However, it is often inaccessible to users without expert knowledge in the area, precluding the widespread use of Constraint Programming techniques. This thesis addresses this issue in thre ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
Constraint Programming is a powerful technique for solving largescale combinatorial (optimisation) problems. However, it is often inaccessible to users without expert knowledge in the area, precluding the widespread use of Constraint Programming techniques. This thesis addresses this issue in three main contributions. First, we propose a simple ‘modelandsolve ’ approach, consisting of a framework where the user formulates a solverindependent problem model, which is then automatically tailored to the input format of a selected constraint solver (a process similar to compiling a highlevel modelling language to machine code). The solver is then executed on the input, solver, and solutions (if they exist) are returned to the user. This allows the user to formulate constraint models without requiring any particular background knowledge of the respective solver and its solving technique. Furthermore, since the framework can target several solvers, the user can explore different types of solvers. Second, we extend the tailoring process with model optimisations that can compensate for a wide selection of poor modelling choices that novices (and experts) in Constraint Programming often make and hence result in redundancies. The elimination of these redundancies
Local Search and Constraint Programming for the PostEnrolmentbased Course Timetabling Problem.
 Annals of Operations Research,
, 2010
"... Abstract. We present a study of the university postenrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form o ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We present a study of the university postenrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint programming approach uses an original problem decomposition. Incorporating this into a large neighbourhood search scheme seems promising.
Markov constraints: steerable generation of Markov sequences
, 2010
"... Markov chains are a well known tool to model temporal properties of many phenomena, from text structure to fluctuations in economics. Because they are easy to generate, Markovian sequences, i.e. temporal sequences having the Markov property, are also used for content generation applications such as ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
Markov chains are a well known tool to model temporal properties of many phenomena, from text structure to fluctuations in economics. Because they are easy to generate, Markovian sequences, i.e. temporal sequences having the Markov property, are also used for content generation applications such as text or music generation that imitate a given style. However, Markov sequences are traditionally generated using greedy, lefttoright algorithms. While this approach is computationally cheap, it is fundamentally unsuited for interactive control. This paper addresses the issue of generating steerable Markovian sequences. We target interactive applications such as games, in which users want to control, through simple input devices, the way the system generates a Markovian sequence, such as a text, a musical sequence or a drawing. To this aim, we propose to revisit Markov sequence generation as a branch and bound constraint satisfaction problem (CSP). We propose a CSP formulation of the basic Markovian hypothesis as elementary Markov Constraints (EMC). We propose algorithms that achieve domainconsistency for the propagators of EMCs, in an eventbased implementation of CSP. We show how EMCs can be combined to estimate the global Markovian probability of a whole sequence, and accommodate for different species of Markov generation such as fixed order, variableorder, or smoothing. Such a formulation, although more costly than traditional greedy generation algorithms, yields the immense advantage of being naturally steerable, since control specifications can be represented by arbitrary additional constraints, without any modification of the generation algorithm. We illustrate our approach on simple yet combinatorial chord sequence and melody generation problems and give some performance results.
Constraint programming for air traffic management: A survey
, 2012
"... Air traffic management (ATM) under its current paradigm is reaching its structural limits considering the continuously growing demand. The need for a decrease in traffic workload opens numerous problems for optimisation, from capacity balancing to conflict solving, using many different degrees of fr ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Air traffic management (ATM) under its current paradigm is reaching its structural limits considering the continuously growing demand. The need for a decrease in traffic workload opens numerous problems for optimisation, from capacity balancing to conflict solving, using many different degrees of freedom, such as rerouting, flightlevel changes, or groundholding schemes. These problems are usually of a large dimension (there are 30, 000 daily flights in Europe in the year 2012) and highly combinatorial, hence challenging for current problem solving technologies. We give brief tutorials on ATM and constraint programming (CP), and survey the literature on deploying CP technology for modelling and solving combinatorial problems that occur in an ATM context.
Connections and Integration with SAT Solvers: A Survey and a Case Study in Computational Biology
"... Boolean constraints play a fundamental rôle in optimization and constraint satisfaction. The resolution of these constraints has been the subject of intense and successful work during the past decade, and SAT solvers have reached a spectacular maturity. This chapter gives a brief overview of the rel ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Boolean constraints play a fundamental rôle in optimization and constraint satisfaction. The resolution of these constraints has been the subject of intense and successful work during the past decade, and SAT solvers have reached a spectacular maturity. This chapter gives a brief overview of the relevant literature on modern SAT solvers and on the recent efforts to better integrate Boolean reasoning with other constraint satisfaction techniques. As a case study that illustrates the use of SAT and CP we consider an application in computational biology: the task to build gene regulatory networks (GRNs). We report on experiments made on this problem with a combined SAT/CP approach.
Domain Views for Constraint Programming
, 2013
"... Views are a standard abstraction in constraint programming: They make it possible to implement a single version of each constraint, while avoiding to create new variables and constraints that would slow down propagation. Traditional constraintprogramming systems provide the concept of variable vie ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Views are a standard abstraction in constraint programming: They make it possible to implement a single version of each constraint, while avoiding to create new variables and constraints that would slow down propagation. Traditional constraintprogramming systems provide the concept of variable views which implement a view of the type y = f(x) by delegating all (domain and constraint) operations on variable y to variable x. This paper proposes the alternative concept of domain views which only delegate domain operations. Domain views preserve the benefits of variable views but simplify the implementation of valuebased propagation. Domain views also support noninjective views compositionally, expanding the scope of views significantly. Experimental results demonstrate the practical benefits of domain views.
An automaton Constraint for Local Search
, 2011
"... We explore the idea of using automata to implement new constraints for local search. This is already a successful approach in constraintbased global search. We show how to maintain the violations of a constraint and its variables via a deterministic finite automaton that describes a ground checker ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We explore the idea of using automata to implement new constraints for local search. This is already a successful approach in constraintbased global search. We show how to maintain the violations of a constraint and its variables via a deterministic finite automaton that describes a ground checker for that constraint. We extend the approach to counter automata, which are often much more convenient than finite automata, if not more independent of the constraint instance. We establish the practicality of our approach on several reallife combinatorial problems.
A ConstraintBased Model for Fast PostDisaster Emergency Vehicle Routing
 in "international Jorunal of Interactive Multimedia and Artificial Intelligence
"... AbstractDisasters like terrorist attacks, earthquakes, hurricanes, and volcano eruptions are usually unpredictable events that affect a high number of people. We propose an approach that could be used as a decision support tool for a postdisaster response that allows the assignment of victims to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
AbstractDisasters like terrorist attacks, earthquakes, hurricanes, and volcano eruptions are usually unpredictable events that affect a high number of people. We propose an approach that could be used as a decision support tool for a postdisaster response that allows the assignment of victims to hospitals and organizes their transportation via emergency vehicles. By exploiting the synergy between Mixed Integer Programming and Constraint Programming techniques, we are able to compute the routing of the vehicles so as to rescue much more victims than both heuristic based and complete approaches in a very reasonable time.
Generation of Implied Constraints for AutomatonInduced Decompositions
"... Abstract—Automata, possibly with counters, allow many constraints to be expressed in a simple and highlevel way. An automaton induces a decomposition into a conjunction of already implemented constraints. Generalised arc consistency is not generally maintained on decompositions induced by counter a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—Automata, possibly with counters, allow many constraints to be expressed in a simple and highlevel way. An automaton induces a decomposition into a conjunction of already implemented constraints. Generalised arc consistency is not generally maintained on decompositions induced by counter automata with more than one state or counter. To improve propagation of automatoninduced constraint decompositions, we use automated tools to derive loop invariants from the constraint checker corresponding to the given automaton. These loop invariants correspond to implied constraints, which can be added to the decomposition. We consider two global constraints and derive implied constraints to improve propagation even to the point of maintaining generalised arc consistency. Keywordsconstraint programming; implied constraints; global constraints; generalised arc consistency; invariants; automata I.
choco: an Open SOurce Java . . .
"... choco is a java library for constraint satisfaction problems (CSP) and constraint programming (CP). It is built on a eventbased propagation mechanism with backtrackable structures. choco is an opensource software, distributed under a BSD licence and hosted by sourceforge.net. choco is mainly de ..."
Abstract
 Add to MetaCart
choco is a java library for constraint satisfaction problems (CSP) and constraint programming (CP). It is built on a eventbased propagation mechanism with backtrackable structures. choco is an opensource software, distributed under a BSD licence and hosted by sourceforge.net. choco is mainly developped by people at École des Mines de Nantes (France) and is financially supported by Bouygues SA and Amadeus SA.