Variable Elimination in Binary CSPs (Extended Abstract)

We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability. We propose new rules and compare them, both theoretically and experimentally. We give optimised algorithms to apply these rules and show that each defines a novel tractable class. Using our variableelimination rules in preprocessing allowed us to solve more benchmark problems than without.

[1]  Eugene C. Freuder.  Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[2]  Stefan Kratsch,et al.  Point Line Cover , 2013, ACM Trans. Algorithms.

[3]  Martin C. Cooper.  Beyond Consistency and Substitutability , 2014, CP.

[4]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[5]  Christophe Lecoutre,et al.  Constraint Networks: Techniques and Algorithms , 2009 .

[6]  Martin C. Cooper,et al.  Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination , 2010, Artif. Intell..

[7]  Martin C. Cooper,et al.  Constraints, Consistency and Closure , 1998, Artif. Intell..

[8]  Roland H. C. Yap,et al.  An optimal coarse-grained arc consistency algorithm , 2005, Artif. Intell..

[9]  Dhiraj K. Pradhan,et al.  NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances , 2004, SAT.

[10]  E. Chong,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[11]  Kevin Leyton-Brown,et al.  Deep optimization for spectrum repacking , 2017, Commun. ACM.

[12]  Javier Larrosa,et al.  Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems , 2003, Constraints.

[13]  David Eppstein,et al.  3-Coloring in time O(1.3446n): A no-MIS Algorithm , 1995, Electron. Colloquium Comput. Complex..

[14]  Roland H. C. Yap,et al.  Solving functional constraints by variable substitution , 2010, Theory and Practice of Logic Programming.

[15]  Martin C. Cooper,et al.  Variable and value elimination in binary constraint satisfaction via forbidden patterns , 2015, J. Comput. Syst. Sci..

[16]  Martin C. Cooper,et al.  Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems , 2016, Artif. Intell..