A preprocessing algorithm that converts small subproblems of a CSP into a regular constraint shows strong speedups on Black Hole, mixed results on Battleships, and best performance combined with table substitution.
AI Communications 20(3), 211–226 (2007), http://content.iospress.com/articles/ai-communications/aic405
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Regularization of Small Sub-Constraint Satisfaction Problems
A preprocessing algorithm that converts small subproblems of a CSP into a regular constraint shows strong speedups on Black Hole, mixed results on Battleships, and best performance combined with table substitution.