A CSP search algorithm with responsibility sets and kernels

Razgon, Igor and Meisels, A. (2007) A CSP search algorithm with responsibility sets and kernels. Constraints: An International Journal 12 , pp. 151-177. ISSN 1383-7133.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/s10601-007-9016-x

Abstract

A CSP search algorithm, like FC or MAC, explores a search tree during its run. Every node of the search tree can be associated with a CSP created by the refined domains of unassigned variables. If the algorithm detects that the CSP associated with a node is insoluble, the node becomes a dead-end. A strategy of pruning “by analogy” states that the current node of the search tree can be discarded if the CSP associated with it is “more constrained” than a CSP associated with some dead-end node. In this paper we present a method of pruning based on the above strategy. The information about the CSPs associated with dead-end nodes is kept in the structures called responsibility sets and kernels. We term the method that uses these structures for pruning RKP, which is abbreviation of Responsibility set, Kernel, Propagation. We combine the pruning method with algorithms FC and MAC. We call the resulting solvers FC-RKP and MAC-RKP, respectively. Experimental evaluation shows that MAC-RKP outperforms MAC-CBJ on random CSPs and on random graph coloring problems. The RKP-method also has theoretical interest. We show that under certain restrictions FC-RKP simulates FC-CBJ. It follows from the fact that intelligent backtracking implicitly uses the strategy of pruning “by analogy.”

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	11 Oct 2021 10:30
Last Modified:	09 Aug 2023 12:52
URI:	https://eprints.bbk.ac.uk/id/eprint/46183

Statistics

Archive Staff Only (login required)

Edit/View Item