Cited in
(36)- Modelling and solving English peg solitaire
- Constraint satisfaction techniques in planning and scheduling: an introduction
- A weighted CSP approach to cost-optimal planning
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- Solving sequential planning problems via constraint satisfaction
- AI planning in a constraint programming framework
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- Long-distance mutual exclusion for planning
- Planning as heuristic search
- Binary vs. non-binary constraints
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Planning as satisfiability: parallel plans and algorithms for plan search
- Concise finite-domain representations for PDDL planning tasks
- Solving Simple Planning Problems with More Inference and No Search
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Resource-driven mission-phasing techniques for constrained agents in stochastic environments
- Modification strategies for SAT-based plan adaptation
- QOCA
- RealPlan
- IPC-4
- STAN
- Siege
- Walksat
- PDDL
- Graphplan
- UCPOP
- VHPOP
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Functional strips: A more flexible language for planning and problem solving
- Redundant modeling for the quasigroup completion problem
- Combining linear programming and satisfiability solving for resource planning
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
- Constraint solving in uncertain and dynamic environments: A survey
- Logic Programming
- Constraint-based agents. An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
- Planning and control in artificial intelligence: A unifying perspective
This page was built for software: CPlan
