QCSP Made Practical by Virtue of Restricted Quantification - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

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.
No file

Dates and versions

hal-00144921 , version 1 (07-05-2007)

Identifiers

  • HAL Id : hal-00144921 , version 1

Cite

Marco Benedetti, Arnaud Lallouet, Jérémie Vautard. QCSP Made Practical by Virtue of Restricted Quantification. Jan 2007, Hyderabad, India. pp.38-43. ⟨hal-00144921⟩
42 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More