QCSP Made Practical by Virtue of Restricted Quantification
Abstract
The QCSP+ language we introduce extends the framework of Quantified Constraint Satisfaction Problems (QCSPs) by enabling us to neatly express restricted quantifications via a chain of nested CSPs to be interpreted as alternately conjuncted and disjuncted. Restricted quantifiers turn out to be a convenient solution to the crippling modeling issues we encounter in QCSP and — surprisingly — they help to reuse propagation technology and to prune the search space. Our QCSP+ solver — which also handles arithmetic and global constraints — exhibits state-of-the-art performances.
Cite
Text
Benedetti et al. "QCSP Made Practical by Virtue of Restricted Quantification." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Benedetti et al. "QCSP Made Practical by Virtue of Restricted Quantification." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/benedetti2007ijcai-qcsp/)BibTeX
@inproceedings{benedetti2007ijcai-qcsp,
title = {{QCSP Made Practical by Virtue of Restricted Quantification}},
author = {Benedetti, Marco and Lallouet, Arnaud and Vautard, Jérémie},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {38-43},
url = {https://mlanthology.org/ijcai/2007/benedetti2007ijcai-qcsp/}
}