Propagate the Right Thing: How Preferences Can Speed-up Constraint Solving

Abstract

We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without changing the pruning and shape of the search tree. Arc consistency thus becomes more scalable and usable for many realworld constraint satisfaction problems such as configuration and scheduling. Moreover, Pref-AC directly computes a preferred solution for tree-like constraint satisfaction problems. 1

Cite

Text

Bessiere et al. "Propagate the Right Thing: How Preferences Can Speed-up Constraint Solving." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Bessiere et al. "Propagate the Right Thing: How Preferences Can Speed-up Constraint Solving." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/bessiere2003ijcai-propagate/)

BibTeX

@inproceedings{bessiere2003ijcai-propagate,
  title     = {{Propagate the Right Thing: How Preferences Can Speed-up Constraint Solving}},
  author    = {Bessiere, Christian and Fabre, Anaïs and Junker, Ulrich},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {191-196},
  url       = {https://mlanthology.org/ijcai/2003/bessiere2003ijcai-propagate/}
}