Planning of Parallel Abstract Programs as Boolean Satisfiability.
Gennady A. OparinAlexei P. NovopashinPublished in: PaCT (2005)
Keyphrases
- boolean satisfiability
- sat solving
- probabilistic planning
- boolean optimization
- heuristic search
- planning problems
- sat solvers
- branch and bound algorithm
- sat problem
- planning under uncertainty
- symmetry breaking
- integer linear programming
- randomly generated
- decision theoretic
- ai planning
- combinatorial problems
- max sat
- constraint programming
- dynamical systems