Distance Constraints in Constraint Satisfaction
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.
Cite
Text
Hebrard et al. "Distance Constraints in Constraint Satisfaction." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Hebrard et al. "Distance Constraints in Constraint Satisfaction." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/hebrard2007ijcai-distance/)BibTeX
@inproceedings{hebrard2007ijcai-distance,
title = {{Distance Constraints in Constraint Satisfaction}},
author = {Hebrard, Emmanuel and O'Sullivan, Barry and Walsh, Toby},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {106-111},
url = {https://mlanthology.org/ijcai/2007/hebrard2007ijcai-distance/}
}