We introduce data structures called responsibility set and kernel. We present an algorithm FC-RK, 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.
|Number of pages||2|
|Journal||IJCAI International Joint Conference on Artificial Intelligence|
|State||Published - 1 Dec 2005|
|Event||19th International Joint Conference on Artificial Intelligence, IJCAI 2005 - Edinburgh, United Kingdom|
Duration: 30 Jul 2005 → 5 Aug 2005
ASJC Scopus subject areas
- Artificial Intelligence