CPlan

CPlan solves planning problems formulated as constraint satisfaction problems (Source: http://plato.asu.edu)

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 27 articles )

Showing results 1 to 20 of 27.
Sorted by year (citations)

1 2 next

  1. Cooper, Martin C.; De Roquemaurel, Marie; Régnier, Pierre: A weighted CSP approach to cost-optimal planning (2011)
  2. Barták, Roman; Toropila, Daniel: Solving sequential planning problems via constraint satisfaction (2010)
  3. Wu, Jianhui; Durfee, Edmund H.: Resource-driven mission-phasing techniques for constrained agents in stochastic environments (2010)
  4. Chen, Yixin; Huang, Ruoyun; Xing, Zhao; Zhang, Weixiong: Long-distance mutual exclusion for planning (2009)
  5. Garrido, Antonio; Arangu, Marlene; Onaindia, Eva: A constraint programming formulation for planning: From plan scheduling to plan generation (2009)
  6. Helmert, Malte: Concise finite-domain representations for PDDL planning tasks (2009)
  7. Hernando, Antonio: New methods for proving the impossibility to solve problems through reduction of problem spaces (2009)
  8. Barták, Roman: Constraint satisfaction techniques in planning and scheduling: an introduction (2008)
  9. van der Krogt, Roman: Modification strategies for SAT-based plan adaptation (2008)
  10. Jefferson, Christopher; Miguel, Angela; Miguel, Ian; Tarim, S. Armagan: Modelling and solving English peg solitaire (2006)
  11. Rintanen, Jussi; Heljanko, Keijo; Niemelä, Ilkka: Planning as satisfiability: parallel plans and algorithms for plan search (2006)
  12. Vidal, Vincent; Geffner, Héctor: Branching and pruning: An optimal temporal POCL planner based on constraint programming (2006)
  13. Verfaillie, Gérard; Jussien, Narendra: Constraint solving in uncertain and dynamic environments: A survey (2005)
  14. Vidal, Vincent; Geffner, Héctor: Solving simple planning problems with more inference and no search (2005)
  15. Jia, Xiumei; You, Jia-Huai; Yuan, Li Yan: Adding domain dependent knowledge into answer set programs for planning (2004)
  16. Dotú, Iván; del Val, Alvaro; Cebrián, Manuel: Redundant modeling for the quasigroup completion problem (2003)
  17. Gerevini, Alfonso; Serina, Ivan: Planning as propositional CSP: From Walksat to local search techniques for action graphs (2003)
  18. Katsirelos, George; Bacchus, Fahiem: Unrestricted nogood recording in CSP search (2003) ioport
  19. Bacchus, Fahiem; Chen, Xinguang; van Beek, Peter; Walsh, Toby: Binary vs. non-binary constraints (2002)
  20. Bonet, B.; Geffner, H.: Planning as heuristic search (2001)

1 2 next


Further publications can be found at: https://cs.uwaterloo.ca/~vanbeek/publications.html