Variable elimination in binary CSP via forbidden patterns

Authors:
David A. Cohen;Martin C. Cooper;Guillaume Escamocher;Stanislav Živný
Affiliations:
Royal Holloway, University of London, UK;IRIT, University of Toulouse, France;IRIT, University of Toulouse, France;University of Warwick, UK
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 8
Cited 0

Constraint Processing

Constraint Processing
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems

Constraints
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
An optimal coarse-grained arc consistency algorithm

Artificial Intelligence
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Artificial Intelligence
Watched literals for constraint propagation in minion

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Tractable triangles and cross-free convexity in discrete optimisation

Journal of Artificial Intelligence Research
The tractability of CSP classes defined by forbidden patterns

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A variable elimination rule allows the polynomial-time 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.