Here we compare them in terms of how efficiently they can refute an unsatisfiable instance with optimal branching ... The tree-like restrictions, tree-C-RES and tree- NG-RES, exactly capture the power of backtracking with 2-way ... In 2-way branching, we select variable x and a value a a D(x), and make two recursive calls.
|Title||:||Principles and Practice of Constraint Programming - CP 2005|
|Author||:||Peter van Beek|
|Publisher||:||Springer Science & Business Media - 2005-09-22|