Model reformulation plays an important role in improving models, reducing search space so that solutions can be found faster. Hence we categorise model reformulation into three types: a model is reformulated to another model with the same modelling language, a model with non constraint programming standard types is compiled to another model with constraint programming (CP) standard types, and a model is converted to Boolean satisfiability problem (SAT), Mixed-integer programming (MIP), Satisfiability modulo theories (SMT), and Mixed integer linear programming (MILP). Based on these categories, reformulation and compilation could be used in different ways to improve a model such as automatic reformulations, semi-automatic reformulations, MIP...
ABSTRACT. We propose a set of reformulation rules for models of constraint satisfaction problems tha...
Constraint programming is one of the possible ways how to solve complicated combinatorial (and other...
Constraint programming is one of the possible ways how to solve complicated combinatorial (and other...
Model reformulation plays an important role in improving models, reducing search space so that solut...
Model reformulation plays an important role in improving models and reducing search space so that so...
Model reformulation plays an important role in improving models and reducing search space so that so...
International audienceOn the one hand, solvers for the propositional satisfiability problem (SAT) ca...
The performance of constraint based problem solving depends crucially on the problem representation....
While the efficiency and scalability of modern SAT technology offers an intriguing alternative appro...
In this thesis we focus on reformulate constraint satisfaction problems (CSP) into SAT Modulo The...
Constraint programming can be divided very crudely into modeling and solving. Modeling defines the p...
Constraint Programming is a powerful technique for solving large-scale combinatorial (optimisation) ...
When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), mode...
(short version) Constraint satisfaction is the most successful computational paradigm for problem-so...
In this paper we discuss work in progress on the design and implementation of Simply, a system for m...
ABSTRACT. We propose a set of reformulation rules for models of constraint satisfaction problems tha...
Constraint programming is one of the possible ways how to solve complicated combinatorial (and other...
Constraint programming is one of the possible ways how to solve complicated combinatorial (and other...
Model reformulation plays an important role in improving models, reducing search space so that solut...
Model reformulation plays an important role in improving models and reducing search space so that so...
Model reformulation plays an important role in improving models and reducing search space so that so...
International audienceOn the one hand, solvers for the propositional satisfiability problem (SAT) ca...
The performance of constraint based problem solving depends crucially on the problem representation....
While the efficiency and scalability of modern SAT technology offers an intriguing alternative appro...
In this thesis we focus on reformulate constraint satisfaction problems (CSP) into SAT Modulo The...
Constraint programming can be divided very crudely into modeling and solving. Modeling defines the p...
Constraint Programming is a powerful technique for solving large-scale combinatorial (optimisation) ...
When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), mode...
(short version) Constraint satisfaction is the most successful computational paradigm for problem-so...
In this paper we discuss work in progress on the design and implementation of Simply, a system for m...
ABSTRACT. We propose a set of reformulation rules for models of constraint satisfaction problems tha...
Constraint programming is one of the possible ways how to solve complicated combinatorial (and other...
Constraint programming is one of the possible ways how to solve complicated combinatorial (and other...