Local Consistency for Ternary Numeric Constraints
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 392-396.
Abstract
We consider algorithms of the Waltz type for computing local consistency (also called arcconsistency) for constraints over numeric domains. Many commonly used propagation rules do not in fact enforce local consistency. We extend the propa&ation rule given by Faltings [Faltings, 1994j to the case of ternary constraints. Since any general n-ary continuous constraint can be represented as a collection of ternary ones, this also covers n-ary constraints in general. We show how the propagation can be implemented efficiently. The new algorithm gives significantly tighter labellings than previous propagation algorithms on most problems.
@inproceedings{ijcai1997p58,
title = {Local Consistency for Ternary Numeric Constraints},
author = {Faltings, Boi and Gelle, Esther M.},
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 = {392--396},
year = {1997},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1997/58},
}
TY - CPAPER TI - Local Consistency for Ternary Numeric Constraints AU - Faltings, Boi AU - Gelle, Esther M. T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 392 EP - 396 UR - https://ijcai.org/proceedings/1997/58 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
