Unblockable QCSP+ : a special case of quantified problems

Jérémie Vautard (1)

1 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

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.

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⟩