Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning.
Minh Binh DoBiplav SrivastavaSubbarao KambhampatiPublished in: AIPS (2000)
Keyphrases
- sat encodings
- planning problems
- linear arithmetic constraints
- sat solvers
- constraint satisfaction problems
- combinatorial problems
- constraint satisfaction
- solving problems
- graph coloring
- state space
- constraint programming
- orders of magnitude
- traveling salesman problem
- dynamic environments
- transitive closure
- mutual exclusion
- objective function