Distance Constraints in Constraint Satisfaction
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 106-110.
Abstract
Users can often naturally express their preferences in terms of ideal or non-ideal solutions. We show how to reason about logical combinations of distance constraints on ideals and non-ideals using a novel global constraint. We evaluate our approach on both randomly generated and real-world configuration problem instances.
Emmanuel Hebrard, Barry O'Sullivan, and Toby Walsh. 2007. Distance Constraints in Constraint Satisfaction. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07. IJCAI, 106–110. https://ijcai.org/proceedings/2007/15
Hebrard, E., O'Sullivan, B., & Walsh, T. (2007). Distance Constraints in Constraint Satisfaction. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 (pp. 106–110). IJCAI. https://ijcai.org/proceedings/2007/15
@inproceedings{ijcai2007p15,
title = {Distance Constraints in Constraint Satisfaction},
author = {Hebrard, Emmanuel and O'Sullivan, Barry and Walsh, Toby},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {106--110},
year = {2007},
url = {https://ijcai.org/proceedings/2007/15},
}
TY - CPAPER TI - Distance Constraints in Constraint Satisfaction AU - Hebrard, Emmanuel AU - O'Sullivan, Barry AU - Walsh, Toby T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 106 EP - 110 UR - https://ijcai.org/proceedings/2007/15 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
