A review of literature on parallel constraint solving
As multi-core computing is now standard, it seems irresponsible for constraints researchers
to ignore the implications of it. Researchers need to address a number of issues to exploit …
to ignore the implications of it. Researchers need to address a number of issues to exploit …
[HTML][HTML] Automated streamliner portfolios for constraint satisfaction problems
Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial
problems. Solving a problem proceeds in two distinct phases: modelling and solving …
problems. Solving a problem proceeds in two distinct phases: modelling and solving …
Constraint-based search for optimal Golomb rulers
Finding optimal Golomb rulers is an extremely challenging combinatorial problem. The
distance between each pair of mark is unique in a Golomb ruler. For a given number of …
distance between each pair of mark is unique in a Golomb ruler. For a given number of …
Automatic generation and selection of streamlined constraint models via monte carlo search on a model lattice
Streamlined constraint reasoning is the addition of uninferred constraints to a constraint
model to reduce the search space, while retaining at least one solution. Previously it has …
model to reduce the search space, while retaining at least one solution. Previously it has …
Towards portfolios of streamlined constraint models: a case study with the balanced academic curriculum problem
Augmenting a base constraint model with additional constraints can strengthen the
inferences made by a solver and therefore reduce search effort. We focus on the automatic …
inferences made by a solver and therefore reduce search effort. We focus on the automatic …
Automatic streamlining for constrained optimisation
Augmenting a base constraint model with additional constraints can strengthen the
inferences made by a solver and therefore reduce search effort. We focus on the automatic …
inferences made by a solver and therefore reduce search effort. We focus on the automatic …
Half-checking propagators
MZ Lagerkvist, M Rattfeldt - arXiv preprint arXiv:2007.05423, 2020 - arxiv.org
Propagators are central to the success of constraint programming, that is contracting
functions removing values proven not to be in any solution of a given constraint. The …
functions removing values proven not to be in any solution of a given constraint. The …
Reformulations of Constraint Satisfaction Problems: A Survey
HP Vo - 2020 - diva-portal.org
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 …
that solutions can be found faster. Hence we categorise model reformulation into three …
[PDF][PDF] Conjure Documentation
Its input language, Essence, is a high level problem specification language. Essence allows
writing problem specifications at a high level of abstraction and without having to make a lot …
writing problem specifications at a high level of abstraction and without having to make a lot …