Propagation Redundancy for Permutation Channels
Abstract
Finding a good model of a constraint satisfaction problem (CSP) is a challenging task. A modeller must specify a set of constraints that capture the definitions of the problem, and the model should also have strong propagation. In other words,
Cite
Text
Choi et al. "Propagation Redundancy for Permutation Channels." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Choi et al. "Propagation Redundancy for Permutation Channels." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/choi2003ijcai-propagation/)BibTeX
@inproceedings{choi2003ijcai-propagation,
title = {{Propagation Redundancy for Permutation Channels}},
author = {Choi, Chiu Wo and Lee, Jimmy Ho-Man and Stuckey, Peter J.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {1370-1371},
url = {https://mlanthology.org/ijcai/2003/choi2003ijcai-propagation/}
}