@inproceedings{f04fc4508a674112811cf6c17fbebe0b,
title = "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.",
keywords = "Arc consistency, Constraint satisfaction, Forbidden pattern, Tractability",
author = "Cohen, \{David A.\} and Cooper, \{Martin C.\} and Guillaume Escamocher and Stanislav {\v Z}ivn{\'y}",
year = "2013",
language = "English",
isbn = "9781577356332",
series = "IJCAI International Joint Conference on Artificial Intelligence",
pages = "517--523",
booktitle = "IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence",
note = "23rd International Joint Conference on Artificial Intelligence, IJCAI 2013 ; Conference date: 03-08-2013 Through 09-08-2013",
}