CSP Search with Responsibility Sets and Kernels
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1533-1533.
Abstract
We introduce data structures called responsibility set and kernel. We present an algorithm FCRK, which is a modification of FC that maintains these structures and uses them for pruning of the search space. According to our experimental evaluation, FC-RK outperforms FC-CBJ on constraint networks encoding graph k-coloring instances and on non-dense random binary constraint networks.
Igor Razgon, and Amnon Meisels. 2005. CSP Search with Responsibility Sets and Kernels. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 1533–1533. https://ijcai.org/proceedings/2005/257
Razgon, I., & Meisels, A. (2005). CSP Search with Responsibility Sets and Kernels. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 (pp. 1533–1533). IJCAI. https://ijcai.org/proceedings/2005/257
@inproceedings{ijcai2005p257,
title = {CSP Search with Responsibility Sets and Kernels},
author = {Razgon, Igor and Meisels, Amnon},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1533--1533},
year = {2005},
url = {https://ijcai.org/proceedings/2005/257},
}
TY - CPAPER TI - CSP Search with Responsibility Sets and Kernels AU - Razgon, Igor AU - Meisels, Amnon T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1533 EP - 1533 UR - https://ijcai.org/proceedings/2005/257 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
