Structuring Techniques for Constraint Satisfaction Problems
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 418-422.
Abstract
We present a structuring method for discrete constraint satisfaction problems (CSPs). It takes advantage of interchangeabilities to represent sets of equivalent values by meta-values and thus obtain more compact representations. Strongly related variables are clustered into meta-variables to create occurrences of interchangeabilities. By iterative application, a CSP can be transformed into an hierarchy of equivalent CSPs, where each problem is significantly simpler than the original one. This structure is particularly advantageous when a large set of possible solutions must be inspected.
@inproceedings{ijcai1997p62,
title = {Structuring Techniques for Constraint Satisfaction Problems},
author = {Weigel, Rainer and Faltings, Boi},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {418--422},
year = {1997},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1997/62},
}
TY - CPAPER TI - Structuring Techniques for Constraint Satisfaction Problems AU - Weigel, Rainer AU - Faltings, Boi T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 418 EP - 422 UR - https://ijcai.org/proceedings/1997/62 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
