On Reachability, Relevance, and Resolution in the Planning as Satisfiability Approach

@article{Brafman2001OnRR,
  title={On Reachability, Relevance, and Resolution in the Planning as Satisfiability Approach},
  author={Ronen I. Brafman},
  journal={J. Artif. Intell. Res.},
  year={2001},
  volume={14},
  pages={1-28}
}
In recent years, there is a growing awareness of the importance of reachability and relevance-based pruning techniques for planning, but little work speci cally targets these techniques. In this paper, we compare the ability of two classes of algorithms to propagate and discover reachability and relevance constraints in classical planning problems. The rst class of algorithms operates on SAT encoded planning problems obtained using the linear and Graphplan encoding schemes. It applies unit… CONTINUE READING
8 Citations
23 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Investigating the e ect of relevance and reachability constraints on sat encodings of planning

  • M. B. Do, B. Srivastava, S. Kambhampati
  • In Proc. of the Fifth Intl. Conf. on AI Planning…
  • 2000
2 Excerpts

Similar Papers

Loading similar papers…