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

 

Abstract:
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" [...]

 

  Online lending company provides a wide range of ways to get money by means of Tennessee Payday Loans. Therefore, we can say that the active substances in its composition are more perfectly mixed. Vardenafil is not only present in the original Levitra Online, but also as part of its analogs.