Propagating Logical Combinations of Constraints
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 35-39.
Abstract
Many constraint toolkits provide logical connectives like disjunction, negation and implication. These permit complex constraint expressions to be built from primitive constraints. However, the propagation of such complex constraint expressions is typically limited. We therefore present a simple and light weight method for propagating complex constraint expressions. We provide a precise characterization of when this method enforces generalized arc-consistency. In addition, we demonstrate that with our method many different global constraints can be easily implemented.
@inproceedings{ijcai2005p41,
title = {Propagating Logical Combinations of Constraints},
author = {Bacchus, Fahiem and Walsh, Toby},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {35--39},
year = {2005},
url = {https://ijcai.org/proceedings/2005/41},
}
TY - CPAPER TI - Propagating Logical Combinations of Constraints AU - Bacchus, Fahiem AU - Walsh, Toby T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 35 EP - 39 UR - https://ijcai.org/proceedings/2005/41 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: