@inproceedings{29b74b63522f4ab38b6694d2ec5dfcaf,
title = "Contradicting conventional wisdom in constraint satisfaction",
abstract = "Constraint satisfaction problems have wide application in artificial intelligence. They involve finding values for problem variables where the values must be consistent in that they satisfy restrictions on which combinations of values are allowed. Two standard techniques used in solving such problems are backtrack search and consistency inference. Conventional wisdom in the constraint satisfaction community suggests: 1) using consistency inference as preprocessing before search to prune values from consideration reduces subsequent search effort and 2) using consistency inference during search to prune values from consideration is best done at the limited level embodied in the forward checking algorithm. We present evidence contradicting both pieces of conventional wisdom, and suggesting renewed consideration of an approach which fully maintains arc consistency during backtrack search.",
author = "Daniel Sabin and Freuder, \{Eugene C.\}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1994.; 2nd International Workshop on the Principles and Practice of Constraint Programming, PPCP 1994 ; Conference date: 02-05-1994 Through 04-05-1994",
year = "1994",
doi = "10.1007/3-540-58601-6\_86",
language = "English",
isbn = "9783540586012",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "10--20",
editor = "Alan Borning",
booktitle = "Principles and Practice of Constraint Programming - 2nd International Workshop, PPCP 1994, Proceedings",
address = "Germany",
}