Output details
11 - Computer Science and Informatics
University of St Andrews
The Extended Global Cardinality Constraint : An Empirical Survey
<11>Constraint propagation algorithms capture frequently-occurring patterns of inference crucial to the efficiency of modern constraint solvers. The extended global cardinality constraint is widely recognised as fundamental and is implemented in most modern constraint solvers. I extended the basic algorithms in numerous ways, advancing the state of the art for this important constraint. I overturned a published result regarding which basic algorithm is most efficient. The paper provides valuable advice for solver implementors and consequently has attracted interest from Oracle's constraints team. AIJ is the best general AI journal. Also the paper was presented by invitation in IJCAI-13's journal track.