Now showing items 1-2 of 2
Automatically improving constraint models in Savile Row
(2017-10) - Journal article,
When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), modelling and formulation are vital and difficult tasks. Even an expert human may explore many alternatives in modelling a ...
Exploiting short supports for improved encoding of arbitrary constraints into SAT
(Springer, 2016) - Conference item,
Encoding to SAT and applying a highly efficient modern SAT solver is an increasingly popular method of solving finite-domain constraint problems. In this paper we study encodings of arbitrary constraints where unit propagation ...