Skip to Main content Skip to Navigation
Conference papers

Variable Elimination in Binary CSP via Forbidden Patterns

Abstract : A variable elimination rule allows the polynomialtime identification of certain variables whose elimination does not affect the satisfiability of an instance. Variable elimination in the constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. We show that there are essentially just four variable elimination rules defined by forbidding generic sub-instances, known as irreducible patterns, in arc-consistent CSP instances. One of these rules is the Broken Triangle Property, whereas the other three are novel.
Complete list of metadatas
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, April 13, 2015 - 1:37:42 PM
Last modification on : Tuesday, September 8, 2020 - 10:10:02 AM
Long-term archiving on: : Monday, September 14, 2015 - 7:31:46 AM


Files produced by the author(s)


  • HAL Id : hal-01141616, version 1
  • OATAO : 12549


Davis Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislas Zivny. Variable Elimination in Binary CSP via Forbidden Patterns. International Joint Conference on Artificial Intelligence - IJCAI 2013, Aug 2013, Beijing, China. pp. 517-523. ⟨hal-01141616⟩



Record views


Files downloads