QCSP Made Practical by Virtue of Restricted Quantification
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 38-42.
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.
@inproceedings{ijcai2007p4,
title = {QCSP Made Practical by Virtue of Restricted Quantification},
author = {Benedetti, Marco and Lallouet, Arnaud and Vautard, Jérémie},
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 = {38--42},
year = {2007},
url = {https://ijcai.org/proceedings/2007/4},
}
TY - CPAPER TI - QCSP Made Practical by Virtue of Restricted Quantification AU - Benedetti, Marco AU - Lallouet, Arnaud AU - Vautard, Jérémie T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 38 EP - 42 UR - https://ijcai.org/proceedings/2007/4 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
