Planning as satisfiability: parallel plans and algorithms for plan search

Artificial Intelligence

Volumn 170, Issue 12-13, 2006, Pages 1031-1080

  Rintanen, Jussi ^a   Heljanko, Keijo ^b   Niemelä, Ilkka ^b  

^a CSIRO   (Australia)

^b AALTO UNIVERSITY   (Finland)

Author keywords

Complexity; Planning; Satisfiability

Indexed keywords

PROPOSITIONAL LOGIC; SATISFIABILITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; PLANNING; PROBLEM SOLVING; SEMANTICS;

ARTIFICIAL INTELLIGENCE;

EID: 33749564515     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.08.002     Document Type: Article

References (39)

1. Best E., and Devillers R. Sequential and concurrent behavior in Petri net theory. Theoretical Computer Science 55 1 (1987) 87-136
2. Biere A., Cimatti A., Clarke E.M., and Zhu Y. Symbolic model checking without BDDs. In: Cleaveland W.R. (Ed). Tools and Algorithms for the Construction and Analysis of Systems, Proceedings of 5th International Conference, TACAS'99. Lecture Notes in Computer Science vol. 1579 (1999), Springer-Verlag 193-207
3. Blum A.L., and Furst M.L. Fast planning through planning graph analysis. Artificial Intelligence 90 1-2 (1997) 281-300
4. Bonet B., and Geffner H. Planning as heuristic search. Artificial Intelligence 129 1-2 (2001) 5-33
5. Bylander T. A probabilistic analysis of propositional STRIPS planning. Artificial Intelligence 81 1-2 (1996) 241-271
6. Cayrol M., Régnier P., and Vidal V. Least commitment in Graphplan. Artificial Intelligence 130 1 (2001) 85-118
7. A. Cimatti, Personal communication, 2003
8. Diekert V., and Métivier Y. Partial commutation and traces. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages vol. 3 (1997), Springer-Verlag 457-534
9. Dimopoulos Y., Nebel B., and Koehler J. Encoding planning problems in nonmonotonic logic programs. In: Steel S., and Alami R. (Eds). Recent Advances in AI Planning. Fourth European Conference on Planning (ECP'97). Lecture Notes in Computer Science vol. 1348 (1997), Springer-Verlag 169-181
10. Do M.B., and Kambhampati S. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence 132 2 (2001) 151-182
11. Eén N., and Sörensson N. Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89 4 (2003) 543-560
12. Efron B., and Tibshirani R. Bootstrap methods for standard errors, confidence intervals, and other measures of statistical accuracy. Statistical Science 1 (1986) 54-75
13. Efron B., and Tibshirani R. An Introduction to the Bootstrap (1993), Chapman and Hall, New York
14. Ernst M., Millstein T., and Weld D.S. Automatic SAT-compilation of planning problems. In: Pollack M. (Ed). Proceedings of the 15th International Joint Conference on Artificial Intelligence (1997), Morgan Kaufmann 1169-1176
15. M. Ghallab, A. Howe, C. Knoblock, D. McDermott, A. Ram, M. Veloso, D. Weld, D. Wilkins, PDDL-the Planning Domain Definition Language, version 1.2. Technical Report CVC TR-98-003/DCS TR-1165 (Oct.), Yale Center for Computational Vision and Control, Yale University, 1998
16. Gomes C.P., Selman B., Crato N., and Kautz H. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24 1-2 (2000) 67-100
17. Heljanko K. Bounded reachability checking with process semantics. Proceedings of the 12th International Conference on Concurrency Theory (Concur'2001). Lecture Notes in Computer Science vol. 2154 (2001), Springer-Verlag 218-232
18. Heljanko K., Junttila T.A., and Latvala T. Incremental and complete bounded model checking for full PLTL. Computer Aided Verification, Proceedings of the 17th International Conference, CAV 2005. Edinburgh, Scotland, UK, July 6-10, 2005. Lecture Notes in Computer Science vol. 3576 (2005), Springer-Verlag 98-111
19. Hoffmann J., and Nebel B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14 (2001) 253-302
20. Kautz H., and Selman B. Planning as satisfiability. In: Neumann B. (Ed). Proceedings of the 10th European Conference on Artificial Intelligence (1992), John Wiley & Sons 359-363
21. Kautz H., and Selman B. Pushing the envelope: planning, propositional logic, and stochastic search. Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference. August 1996 (1996), AAAI Press 1194-1201
22. Kautz H., and Selman B. Unifying SAT-based and graph-based planning. In: Dean T. (Ed). Proceedings of the 16th International Joint Conference on Artificial Intelligence (1999), Morgan Kaufmann 318-325
23. Kautz H., and Walser J. State-space planning by integer optimization. Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99) and the 11th Conference on Innovative Applications of Artificial Intelligence (IAAI-99) (1999), AAAI Press 526-533
24. A. Khomenko, V. Kondratyev, M. Koutny, W. Vogler, Merged processes-a new condensed representation of Petri net behaviour, Technical report CS-TR 884 (Jan.), School of Computing Science, University of Newcastle upon Tyne, 2005
25. Khomenko A., Kondratyev V., Koutny M., and Vogler W. Merged processes-a new condensed representation of Petri net behaviour. In: Abadi M., and de Alfaro L. (Eds). CONCUR 2005-Concurrency Theory, Proceedings of the 16th International Conference, CONCUR 2005. San Francisco, CA, USA, August 23-26, 2005. Lecture Notes in Computer Science vol. 3653 (2005), Springer-Verlag 338-352
26. Luby M., and Ertel R. Optimal parallelization of Las Vegas algorithms. Proceedings of the Annual Symposium on the Theoretical Aspects of Computer Science (STACS'94) (1994), Springer-Verlag 463-474
27. McMillan K.L. Interpolation and SAT-based model checking. In: Hunt Jr. W.A., and Somenzi F. (Eds). Proceedings of the 15th International Conference on Computer Aided Verification (CAV 2003). Lecture Notes in Computer Science vol. 2725 (2003), Springer-Verlag 1-13
28. Mneimneh M., and Sakallah K. Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution. In: Giunchiglia E., and Tacchella A. (Eds). SAT 2003-Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science vol. 2919 (2003), Springer-Verlag 411-425
29. Nabeshima H., Iwanuma K., and Inoue K. Effective SAT planning by speculative computation. In: McKay R.I., and Slaney J. (Eds). AI 2002: Advances in Artificial Intelligence: Proceedings of the 15th Australian Joint Conference on Artificial Intelligence. Canberra, Australia, December 2-6, 2002. Lecture Notes in Computer Science vol. 2557 (2002), Springer-Verlag 726-727
30. Ogata S., Tsuchiya T., and Kikuno T. SAT-based verification of safe Petri nets. In: Wang F. (Ed). Automated Technology for Verification and Analysis: Proceedings of the Second International Conference, ATVA 2004. Taipei, Taiwan, ROC, October 31-November 3, 2004. Lecture Notes in Computer Science vol. 3299 (2004), Springer-Verlag 79-92
31. Rintanen J. A planning algorithm not based on directional search. In: Cohn A.G., Schubert L.K., and Shapiro S.C. (Eds). Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98). June 1998 (1998), Morgan Kaufmann 617-624
32. Rintanen J. Evaluation strategies for planning as satisfiability. In: López de Mántaras R., and Saitta L. (Eds). ECAI 2004: Proceedings of the 16th European Conference on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications vol. 110 (2004), IOS Press 682-687
33. Rintanen J. Phase transitions in classical planning: an experimental study. In: Dubois D., Welty C.A., and Williams M.-A. (Eds). Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004) (2004), AAAI Press 710-719
34. J. Rintanen, State-space traversal techniques for planning, Report 220, Albert-Ludwigs-Universität Freiburg, Institut für Informatik, 2005
35. Rintanen J., Heljanko K., and Niemelä I. Parallel encodings of classical planning as satisfiability. In: Alferes J.J., and Leite J. (Eds). Logics in Artificial Intelligence: Proceedings of the 9th European Conference, JELIA 2004. Lisbon, Portugal, September 27-30, 2004. Lecture Notes in Computer Science vol. 3229 (2004), Springer-Verlag 307-319
36. Sheeran M., Singh S., and Stålmarck G. Checking safety properties using induction and a SAT-solver. In: Hunt W.A., and Johnson S.D. (Eds). Formal Methods in Computer-Aided Design, Proceedings of the Third International Conference, FMCAD 2000. Austin, Texas, USA, November 1-3, 2000. Lecture Notes in Computer Science vol. 1954 (2000), Springer-Verlag 108-125
37. van Beek P., and Chen X. CPlan: A constraint programming approach to planning. Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99) and the 11th Conference on Innovative Applications of Artificial Intelligence (IAAI-99) (1999), AAAI Press 585-590
38. Wolfman S.A., and Weld D.S. The LPSAT engine & its application to resource planning. In: Dean T. (Ed). Proceedings of the 16th International Joint Conference on Artificial Intelligence vol. 1 (1999), Morgan Kaufmann 310-315
39. Zarpas E. Simple yet efficient improvements of SAT based bounded model checking. In: Hu A.J., and Martin A.K. (Eds). Formal Methods in Computer-Aided Design: Proceedings of the 5th International Conference, FMCAD 2004. Austin, Texas, USA, November 15-17, 2004. Lecture Notes in Computer Science vol. 3312 (2004), Springer-Verlag 174-185