Watched Literals for Constraint Propagation in Minion

DOI10.1007/11889205_15zbMath1420.68195OpenAlexW1815010250MaRDI QIDQ3524241

Chris Jefferson, Ian Miguel, Ian Philip Gent

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889205_15

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

Generalised arc consistency for the AllDifferent constraint: an empirical survey ⋮ Towards breaking more composition symmetries in partial symmetry breaking ⋮ Implementing logical connectives in constraint programming ⋮ A pearl on SAT and SMT solving in Prolog ⋮ A microkernel architecture for constraint programming ⋮ The extended global cardinality constraint: an empirical survey ⋮ Propagation engine prototyping with a domain specific language ⋮ Optimal and efficient filtering algorithms for table constraints ⋮ View-based propagation of decomposable constraints ⋮ Variable and value elimination in binary constraint satisfaction via forbidden patterns

Uses Software

• MINION

This page was built for publication: Watched Literals for Constraint Propagation in Minion