Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs.
Alfonso GereviniIvan SerinaPublished in: Constraints An Int. J. (2003)
Keyphrases
- stochastic local search
- satisfiability testing
- domain independent planning
- strips planning
- constraint satisfaction problems
- action selection
- clause learning
- satisfiability problem
- derived predicates
- search algorithm
- propositional logic
- planning problems
- genetic algorithm
- sat problem
- constraint graph
- plan execution
- search space
- np complete
- tabu search
- decomposition methods
- graph theory
- phase transition
- causal graph
- multi valued
- initial state
- max sat
- action sequences
- first order logic
- constraint satisfaction
- ai planning
- constraint propagation
- domain independent
- reasoning about actions
- heuristic search
- randomly generated
- lower bound
- constraint programming