Deconstructing planning as satisfiability

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1524-1526

  Kautz, Henry ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750726994     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Beame, P.; Agarwal, A.; and Kautz, H. 2003. Using problem structure for efficient clause learning. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), 159-166.
2. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 95), 1636-1642.
3. Edelkamp, S.; Hoffmann, J.; Littman, M.; and Younes, H. 2004. The 2004 international planning competition. http://ls5-www.cs.uni-dortmund.de/edelkamp/ ipc4/main.html.
4. Eén, N., and Sörensson, N. 2003. An extensible sat-solver. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing.
5. Ernst, M.; Millstein, T. D.; and Weld, D. S. 1997. Automatic SAT-compilation of planning problems. In IJCAI, 1169-1177.
6. Fox, M., and Long, D. 1999. The detection and exploitation of symmetry in planning problems. In IJCAI, 956-961.
7. Hoffmann, J.; Edelkamp, S.; Englert, R.; Liporace, F.; Thiébaux, S.; and Trü, S. 2004. Towards realistic benchmarks for planning: the domains used in the classical part of ipc-4.
8. Hoffmann, J. 2002. Local search topology in planning benchmarks: A theoretical analysis. In Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling.
9. Huang, Y.-C. 2002. Learning control knowledge for planning. PhD Thesis, Cornell University.
10. Joslin, D., and Roy, A. 1997. Exploiting symmetry in lifted CSPs. In AAAI/IAAI, 197-202.
11. Kautz, H., and Selman, B. 1992. Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence, 359-363. Wiley.
12. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), 1194-1201. AAAI Press. (Best Paper Award).
13. Kautz, H., and Selman, B. 1998. Blackbox: A new approach to the application of theorem proving to problem solving. In AIPS-98 Workshop on Planning as Combinatorial Search, 58-60.
14. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding plans in prepositional logic. In Proceedings of the 4th International Conference on Knowledge Representation and Reasoning (KR-96), 374-385. Morgan Kaufmann.
15. Li, C. M., and Anbulagan. 1997. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, 366-371.
16. Majercik, S. M., and Littman, M. L. 1999. Contingent planning under uncertainty via stochastic satisfiability. In AAAI/IAAI, 549-556.
17. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01).
18. Nadel, A. 2002. Backtrack search algorithms for prepositional logic satisfiability: Review and innovations. Master's Thesis, Hebrew Univesity.
19. Rintanen, J. 1999. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10:323-352.
20. Ryan, L. O. 2004. Efficient algorithms for clause learning sat solvers. Masters Thesis, Simon Fraser University.
21. Sabharwal, A. 2005. Symchaff: A structure-aware satisfiability solver. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), 467-474.
22. Seshia, S. A. 2005. Adaptive eager boolean encoding for arithmetic reasoning in verification.
23. Shin, J.-A., and Davis, E. 2005. Processes and continuous change in a sat-based planner. Artificial Intelligence 166:194-253.
24. Shlyakhter, I. 2001. Generating effective symmetry-breaking predicates for search problems. In Proceedings of the Workshop on Theory and Applications of Satisfiability Testing.
25. Wolfman, S. A., and Weld, D. S. 1999. The Ipsat engine and its application to resource planning. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, 310-315.
26. Zhang, H. 1997. Sato: An efficient propositional prover. In Proceedings of the International Conference on Automated Deduction, 272-275.