| Title | Automatic SAT-compilation of planning problems |
| Publication Type | Conference Paper |
| Year of Publication | 1997 |
| Authors | Ernst MD, Millstein TD, Weld DS |
| Conference Name | IJCAI '97: IJCAI-97, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence |
| Pagination | 1169–1176 |
| Date or Month Published | August |
| Conference Location | Nagoya, Aichi, Japan |
| Abstract | Recent work by Kautz \em et al. provides tantalizing evidence that large, classical planning problems may be efficiently solved by translating them into propositional satisfiability problems, using stochastic search techniques, and translating the resulting truth assignments back into plans for the original problems. We explore the space of such transformations, providing a simple framework that generates eight major encodings (generated by selecting one of four action representations and one of two frame axioms) and a number of subsidiary ones. We describe a fully-implemented compiler that can generate each of these encodings, and we test the compiler on a suite of STRIPS planning problems in order to determine which encodings have the best properties. |
| Downloads | ftp://ftp.cs.washington.edu/pub/ai/medic.tar.gz Medic implementation
https://homes.cs.washington.edu/~mernst/pubs/satcompile-ijcai97.pdf PDF
|
| Citation Key | ernst-ijcai97 |
