Problem Transformations and Algorithm Selection for CSPs
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 3221-3221.
Abstract
Our initial line of research has shown that, to achieve the best performance on a constraint satisfaction problem, it may be beneficial to translate it to a satisfiability problem. For this translation, it is important to choose both the encoding and satisfiability solver in combination. By doing so, the contrasting performance among solvers on different representations of the same problem can be exploited. In taking these considerations into account, the performance of a solver portfolio augmented with multiple problem transformations can be improved significantly compared to restricting the portfolio to a single problem representation.
@inproceedings{ijcai2013p497,
title = {Problem Transformations and Algorithm Selection for CSPs},
author = {Hurley, Barry and O'Sullivan, Barry},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {3221--3221},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/497},
}
TY - CPAPER TI - Problem Transformations and Algorithm Selection for CSPs AU - Hurley, Barry AU - O'Sullivan, Barry T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 3221 EP - 3221 UR - https://ijcai.org/proceedings/2013/497 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
