Domain Transmutation in Constraint Satisfaction Problems
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.
Cite
Text
Bowen and Likitvivatanavong. "Domain Transmutation in Constraint Satisfaction Problems." AAAI Conference on Artificial Intelligence, 2004.Markdown
[Bowen and Likitvivatanavong. "Domain Transmutation in Constraint Satisfaction Problems." AAAI Conference on Artificial Intelligence, 2004.](https://mlanthology.org/aaai/2004/bowen2004aaai-domain/)BibTeX
@inproceedings{bowen2004aaai-domain,
title = {{Domain Transmutation in Constraint Satisfaction Problems}},
author = {Bowen, James and Likitvivatanavong, Chavalit},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2004},
pages = {149-154},
url = {https://mlanthology.org/aaai/2004/bowen2004aaai-domain/}
}