Soft arc consistency applied to optimal planning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4204 LNCS, Issue , 2006, Pages 680-684

  Cooper, Martin ^a   Cussat Blanc, Sylvain ^a   De Roquemaurel, Marie ^a   Régnier, Píerre ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

NUMERICAL PLANNING; OPTIMAL PLANNING; SOFT ARC CONSISTENCY TECHNIQUES;

OPTIMAL SYSTEMS;

EID: 33750302950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_50     Document Type: Conference Paper

References (7)

1. A. Blum & M. Furst, "Fast planning through planning graph analysis", AI 90 p.281-300 (1997).
2. M.C. Cooper, "Reduction operations in fuzzy and valued constraint satisfaction", Fuzzy Sets and Systems 134, p.311-342 (2003).
3. S. de Givry, F. Heras, M. Zytnicki & J. Larrosa, "Existential arc consistency: Getting closer to full arc consistency in weighted CSPs", IJCAI 2005 p.84-89.
4. M. Do & S. Kambhampati, "Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP", AI 132 p.151-182 (2001)
5. P. Haslum & H. Geffner, "Heuristic Planning with Time and Resources", European Conference on Planning (2001).
6. J. Hoffmann, "The Metric-FF Planning System: Translating "Ignoring Delete Lists" to Numeric State Variables", JAIR 20 p.291-341 (2003).
7. J. Larrosa & T. Schiex, "In the quest of the best form of local consistency for Weighted CSP", IJCAI 2003 p.239-244.