Skip to Main content Skip to Navigation
Conference papers

Guiding Search in QCSP+ with Back-Propagation

Abstract : The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universal ones). Despite the expressiveness of QCSP, many problems, such as two-players games or motion planning of robots, remain difficult to express. Two more modeler-friendly frameworks have been proposed to handle this difficulty, the Strategic CSP and the QCSP + . We define what we name back-propagation on QCSP + . We show how back-propagation can be used to define a goal-driven value ordering heuristic and we present experimental results on board games.
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00329894
Contributor : Christian Bessiere <>
Submitted on : Friday, September 20, 2019 - 10:57:45 AM
Last modification on : Thursday, May 14, 2020 - 6:58:06 PM
Long-term archiving on: : Saturday, February 8, 2020 - 11:39:10 PM

File

cp08.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Christian Bessière, Guillaume Verger. Guiding Search in QCSP+ with Back-Propagation. CP: Principles and Practice of Constraint Programming, Sep 2008, Sydney, Australia. pp.175-189, ⟨10.1007/978-3-540-85958-1_12⟩. ⟨lirmm-00329894⟩

Share

Metrics

Record views

154

Files downloads

80