Heikel Batnini

Learn More
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In many interval solvers, the pruning step is based on local consistencies (Hull-Consistency [1, 2], Box-consistency [3–5]) or partial consistencies (kB-consistencies [1, 6],(More)
  • 1