Razgon, Igor and Meisels, A. (2005) CSP search with responsibility sets and kernels. In: Pack Kaelbling, L. and Saffiotti, A. (eds.) IJCAI-05: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Professional Book Center, pp. 1533-1534.
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 11 Oct 2021 12:19 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46245 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
