{"type":"ScholarlyArticle","title":"QCSP Made Practical by Virtue of Restricted Quantification","authors":[{"name":"Marco Benedetti","slug":"marco-benedetti","given":"Marco","family":"Benedetti","affiliation":""},{"name":"Arnaud Lallouet","slug":"arnaud-lallouet","given":"Arnaud","family":"Lallouet","affiliation":""},{"name":"Jérémie Vautard","slug":"jeremie-vautard","given":"Jérémie","family":"Vautard","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2007/4","pdf":"https://ijcai.org/proceedings/2007/0004.pdf","markdown":"https://ijcai.org/proceedings/2007/4.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/4","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":4,"pages":{"first":38,"last":42},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}