Sciweavers

Share
IJCAI
2003

Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems

11 years 29 days ago
Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An algorithm for removing overlapping sub-values is presented. The resulting CSPs take less time to find all solutions and yield a more compactly-representable, but equivalent, solution set. Experimental results show that, especially in loose problems with large numbers of solutions, dramatic savings in search cost are achieved.
James Bowen, Chavalit Likitvivatanavong
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where IJCAI
Authors James Bowen, Chavalit Likitvivatanavong
Comments (0)
books