Unblockable QCSP+ : a special case of quantified problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Unblockable QCSP+ : a special case of quantified problems

Abstract

t. This paper defines a special case of QCSP+ where it is assured that the restricted quantification will never empty the domain of a variable. This subset of problems intuitively corresponds to two-player games where it is not possible to prevent the opponent from playing. Some resolution techniques are defined for this special case, coming in addition to standard search-based QCSP+ resolution and propagation.
No file

Dates and versions

hal-00468755 , version 1 (31-03-2010)

Identifiers

  • HAL Id : hal-00468755 , version 1

Cite

Jérémie Vautard. Unblockable QCSP+ : a special case of quantified problems. Second International Workshop on Quantification in Constraint Programming, Sep 2008, Sydney, Australia. ⟨hal-00468755⟩
25 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More