Domain transmutation in constraint satisfaction problems

Authors:
James Bowen;Chavalit Likitvivatanavong
Affiliations:
Cork Constraint Computation Centre, University College Cork, Ireland;Cork Constraint Computation Centre, University College Cork, Ireland
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 8
Cited 5

Arc and path consistence revisited

Artificial Intelligence
Interchangeability preprocessing can improve forward checking search

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
On the computation of local interchangeability in discrete constraint satisfaction problems

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Supermodels and robustness

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Compiling constraint satisfaction problems

Artificial Intelligence
Random Constraint Satisfaction: Flaws and Structure

Constraints
Interactive constraint-aided conceptual design

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Extracting constraint satisfaction subproblems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Directional Interchangeability for Enhancing CSP Solving

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A domain decomposition algorithm for constraint satisfaction

Journal of Experimental Algorithmics (JEA)
Extracting microstructure in binary constraint networks

CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Many-to-many interchangeable sets of values in CSPs

Proceedings of the 28th Annual ACM Symposium on Applied Computing
Eliminating redundancy in CSPs through merging and subsumption of domain values

ACM SIGAPP Applied Computing Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of "subvalues". We present an algorithm for breaking up values and combining identical fragments. Experimental results show that the transformed problems take less time to solve for all solutions and yield more compactly-representable, but equivalent, solution sets. We obtain new theoretical results on context dependent interchangeability and full interchangeability, and suggest some other applications.