Guiding Search in QCSP+ with Back-Propagation - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2008

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.
Fichier principal
Vignette du fichier
cp08.pdf (179.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00329894 , version 1 (20-09-2019)

Identifiers

Cite

Christian Bessiere, 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⟩
91 View
98 Download

Altmetric

Share

Gmail Facebook X LinkedIn More