Predicting good propagation methods for constraint satisfaction

Authors:
Craig D. S. Thompson;Michael C. Horsch
Affiliations:
Department of Computer Science, University of Saskatchewan, Saskatoon, SK, Canada;Department of Computer Science, University of Saskatchewan, Saskatoon, SK, Canada
Venue:
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Year:
2012

Citing 10
Cited 0

Constraint satisfaction algorithms

Computational Intelligence
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Heuristics for Dynamically Adapting Propagation

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
SATzilla: portfolio-based algorithm selection for SAT

Journal of Artificial Intelligence Research
The constrainedness of search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Performance prediction and automated tuning of randomized and parametric algorithms

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Using CBR to select solution strategies in constraint programming

ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given the breadth of constraint satisfaction problems (CSPs) and the wide variety of CSP solvers, it can be difficult to determine a priori which solving method is best suited to a problem. We explore the use of machine learning to predict which solving method will be most effective for a given problem. Our investigation studies the problem of attribute selection for CSPs, and supervised learning to classify CSP instances drawn from four distinct CSP classes. We limit our study to the choice of two well-known, but simple, CSP solvers. We show that the average performance of the resulting solver is very close to the average performance of a CSP solver based on an oracle.