ML Anthology

CSP Search with Responsibility Sets and Kernels

Igor Razgon, Amnon Meisels
IJCAI 2005 pp. 1533-1534
/ijcai/2005/razgon2005ijcai-csp/

Abstract

We introduce data structures called responsibility set and kernel. We present an algorithm FCRK, which is a modification of FC that maintains
\nthese structures and uses them for pruning of the
\nsearch space. According to our experimental evaluation, FC-RK outperforms FC-CBJ on constraint
\nnetworks encoding graph k-coloring instances and
\non non-dense random binary constraint networks.

PDF Semantic Scholar

Cite

Text

Razgon and Meisels. "CSP Search with Responsibility Sets and Kernels." International Joint Conference on Artificial Intelligence, 2005.

Markdown

[Razgon and Meisels. "CSP Search with Responsibility Sets and Kernels." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/razgon2005ijcai-csp/)

BibTeX

@inproceedings{razgon2005ijcai-csp,
  title     = {{CSP Search with Responsibility Sets and Kernels}},
  author    = {Razgon, Igor and Meisels, Amnon},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {1533-1534},
  url       = {https://mlanthology.org/ijcai/2005/razgon2005ijcai-csp/}
}