Tuesday, 13:45 - 14:10 h, Room: H 1058


Peter Nightingale
Watched literals and generating propagators in constraint programming

Coauthors: Ian P. Gent, Christopher Jefferson, Ian Miguel


Many modern constraint solvers interleave constraint reasoning (propagation) with a complete search. In systems like these, the efficiency of propagation is vital, because the solver spends almost all of its time doing propagation. In this talk I will present a number of techniques developed at St Andrews to improve the efficiency of propagation, in some cases by orders of magnitude.
Watched literals are used in SAT (propositional satisfiability) solvers where they are helpful in dealing with the huge number of long constraints generated by conflict learning. I will discuss porting watched literals to CP, and when this is useful. I will also talk about automatic generation of propagation algorithms, and when this can outperform even hand-optimised algorithms.
Most of the techniques are implemented in the Minion solver. I will give an overview of Minion's features, strengths and weaknesses.


Talk 2 of the invited session Tue.2.H 1058
"Software for constraint programming" [...]
Cluster 10
"Implementations & software" [...]


  Most online loan lenders allow getting Payday Loans New Jersey without visiting a bank, straight to your bank account. There are also a lot of other privileges for return customers. Men buy Viagra Gold online not to wait till the lucky event happens but to enjoy each sex act because Viagra effect lasts up to 36 hours!