Planning and SAT

Frontiers in Artificial Intelligence and Applications

Volumn 185, Issue 1, 2009, Pages 483-504

  Rintanen, Jussi ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER AIDED ANALYSIS;

ALGORITHM FOR SOLVING; BOUNDED MODEL CHECKING; COMPUTER-AIDED VERIFICATIONS; ENCODINGS; PARALLEL PLANS; PLANNING PROBLEM; REACHABILITY PROBLEM; SAT PROBLEMS; SAT-SOLVING; TRANSITION SYSTEM;

MODEL CHECKING;

EID: 72949118667     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-929-5-483     Document Type: Article

References (46)

1. R. Alur, R. K. Brayton, T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Partial-order reduction in symbolic state space exploration. In Computer Aided Verification, 9th International Conference, CAV'97, Haifa, Israel, June 22-25, 1997, Proceedings, volume 1254 of Lecture Notes in Computer Science, pages 340-351. Springer-Verlag, 1997.
2. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In W. R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems, Proceedings of 5th International Conference, TACAS'99, volume 1579 of Lecture Notes in Computer Science, pages 193-207. Springer-Verlag, 1999.
3. A. L. Blum and M. L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2):281-300, 1997.
4. R. I. Brafman and H. H. Hoos. To encode or not to encode - linear planning. In T. Dean, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence, pages 988-995. Morgan Kaufmann Publishers, 1999.
5. R. I. Brafman and J. Hoffmann. Conformant planning via heuristic forward search: A new approach. In S. Zilberstein, J. Koehler, and S. Koenig, editors, ICAPS 2004. Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, pages 355-364. AAAI Press, 2004.
6. C. Baral, V. Kreinovich, and R. Trejo. Computational complexity of planning and approximate planning in the presence of incompleteness. Artificial Intelligence, 122(1):241-267, 2000.
7. M. Büttner and J. Rintanen. Satisfiability planning with constraints on the number of actions. In S. Biundo, K. Myers, and K. Rajan, editors, ICAPS 2005. Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling, pages 292-299. AAAI Press, 2005.
8. R. I. Brafman. On reachability, relevance, and resolution in the planning as satisfiability approach. Journal of Artificial Intelligence Research, 14:1-28, 2001.
9. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
10. J. Crawford, M. Ginsberg, E. Luks, and A. Roy. Symmetry-breaking predicates for search problems. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR '96), pages 148-159. Morgan Kaufmann Publishers, 1996.
11. C. Castellini, E. Giunchiglia, and A. Tacchella. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence, 147(1-2):85-117, 2003.
12. M. B. Do and S. Kambhampati. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence, 132(2):151-182, 2001.
13. Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in nonmonotonic logic programs. In S. Steel and R. Alami, editors, Recent Advances in AI Planning. Fourth European Conference on Planning (ECP'97), number 1348 in Lecture Notes in Computer Science, pages 169-181. Springer-Verlag, 1997.
14. M. Ernst, T. Millstein, and D. S. Weld. Automatic SAT-compilation of planning problems. In M. Pollack, editor, Proceedings of the 15th International Joint Conference on Artificial Intelligence, pages 1169- 1176. Morgan Kaufmann Publishers, 1997.
15. N. Éen and N. Sörensson. Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science, 89(4):543-560, 2003.
16. A. Grastien, Anbulagan, J. Rintanen, and E. Kelareva. Diagnosis of discrete-event systems using satisfiability algorithms. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07), pages 305-310. AAAI Press, 2007.
17. P. Godefroid. Using partial orders to improve automatic verification methods. In E. M. Clarke, editor, Proceedings of the 2nd International Conference on Computer-Aided Verific ation (CAV '90), Rutgers, New Jersey, 1990, number 531 in Lecture Notes in Computer Science, pages 176-185. Springer-Verlag, 1991.
18. A. Gerevini and L. Schubert. Inferring state constraints for domainindependent planning. In Proceedings of the 15th National Confer ence on Artificial Intelligence (AAAI-98) and the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 905-912. AAAI Press, 1998.
19. P. Haslum and P. Jonsson. Some results on the complexity of planning with incomplete information. In S. Biundo and M. Fox, editors, Recent Advances in AI Planning. Fifth European Conference on Planning (ECP'99), number 1809 in Lecture Notes in Artificial Intelligence, pages 308-318. Springer-Verlag, 2000.
20. Y.-C. Huang, B. Selman, and H. A. Kautz. Control knowledge in planning: Benefits and tradeoffs. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99) and the 11th Conference on Innovative Applications of Artificial Intelligence (IAAI-99), pages 511-517, 1999.
21. H. Kautz, D. McAllester, and B. Selman. Encoding plans in propositional logic. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR '96), pages 374-385. Morgan Kaufmann Publishers, 1996.
22. H. Kautz and B. Selman. Planning as satisfiability. In B. Neumann, editor, Proceedings of the 10th European Conference on Artificial Intelligence, pages 359-363. John Wiley & Sons, 1992.
23. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pages 1194-1201. AAAI Press, August 1996.
24. H. Kautz and J. Walser. State-space planning by integer optimization. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99) and the 11th Conference on Innovative Applications of Artificial Intelligence (IAAI-99), pages 526-533. AAAI Press, 1999.
25. S. M. Majercik and M. L. Littman. Contingent planning under uncertainty via stochastic satisfiability. Artificial Intelligence, 147(1- 2):119-162, 2003.
26. D. A. McAllester and D. Rosenblitt. Systematic nonlinear planning. In T. L. Dean and K. McKeown, editors, Proceedings of the 9th National Conference on Artificial Intelligence, pages 634-639. AAAI Press / The MIT Press, 1991.
27. C. Pixley and G. Beihl. Calculating resettability and reset sequences. In Computer-Aided Design, 1991. ICCAD-91. Digest of Technical Papers., 1991 IEEE International Conference, pages 376-379, 1991.
28. H. Palacios, B. Bonet, A. Darwiche, and H. Geffner. Pruning conformant plans by counting models on compiled d-DNNF representations. In S. Biundo, K. Myers, and K. Rajan, editors, ICAPS 2005. Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling, pages 141-150. AAAI Press, 2005.
29. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on the Foundations of Computer Science, pages 46-57. IEEE, 1977.
30. J. Rintanen and A. Grastien. Diagnosability testing with satisfiability algorithms. In M. Veloso, editor, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pages 532-537. AAAI Press, 2007.
31. J. Rintanen, K. Heljanko, and I. Niemelä. Planning as satisfiability: Parallel plans and algorithms for plan search. Artificial Intelligence, 170(12-13):1031-1080, 2006.
32. J. Rintanen. A planning algorithm not based on directional search. In A. G. Cohn, L. K. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 617-624. Morgan Kaufmann Publishers, June 1998.
33. J. Rintanen. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research, 10:323-352, 1999.
34. J. Rintanen. Symmetry reduction for SAT representations of transition systems. In E. Giunchiglia, N. Muscettola, and D. Nau, editors, Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, pages 32-40. AAAI Press, 2003.
35. J. Rintanen. Asymptotically optimal encodings of conformant planning in QBF. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07), pages 1045-1050. AAAI Press, 2007.
36. J. Rintanen. Regression for classical and nondeterministic planning. In M. Ghallab, C. D. Spyropoulos, and N. Fakotakis, editors, ECAI 2008. Proceedings of the 18th European Conference on Artificial Intelligence, pages 568-571. IOS Press, 2008.
37. E. D. Sacerdoti. The nonlinear nature of plans. In Proceedings of the 4th International Joint Conference on Artificial Intelligence, pages 206-214, 1975.
38. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time. In Proceedings of the 5th Annual ACM Symposium on Theory of Computing, pages 1-9, 1973.
39. M. Streeter and S. F. Smith. Using decision procedures efficiently for optimization. In M. Boddy, M. Fox, and S. Thíebaux, editors, ICAPS 2007. Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, pages 312-319, 2007.
40. O. Strichman. Tuning SAT checkers for bounded model checking. In E. A. Emerson and A. P. Sistla, editors, Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings, volume 1855 of Lecture Notes in Computer Science, pages 480-494. Springer-Verlag, 2000.
41. O. Strichman. Pruning techniques for the SAT-based bounded model checking problem. In T. Margaria and T. F. Melham, editors, Correct Hardware Design and Verification Methods, 11th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2001, Livingston, Scotland, UK, September 4-7, 2001, Proceedings, volume 2144 of Lec ture Notes in Computer Science, pages 58-70. Springer-Verlag, 2001.
42. H. Turner. Polynomial-length planning spans the polynomial hierarchy. In Logics in Artificial Intelligence, European Conference, JELIA 2002, number 2424 in Lecture Notes in Computer Science, pages 111- 124. Springer-Verlag, 2002.
43. A. Valmari. Stubborn sets for reduced state space generation. In G. Rozenberg, editor, Advances in Petri Nets 1990. 10th International Conference on Applications and Theory of Petri Nets, Bonn, Germany, number 483 in Lecture Notes in Computer Science, pages 491-515. Springer-Verlag, 1991.
44. P. van Beek and X. Chen. CPlan: A constraint programming approach to planning. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99) and the 11th Conference on Innovative Applications of Artificial Intelligence (IAAI-99), pages 585-590. AAAI Press, 1999.
45. T. Vossen, M. Ball, A. Lotem, and D. Nau. On the use of integer programming models in AI planning. In T. Dean, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence, pages 304-309. Morgan Kaufmann Publishers, 1999.
46. S. A. Wolfman and D. S. Weld. The LPSAT engine & its application to resource planning. In T. Dean, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence, pages 310- 315. Morgan Kaufmann Publishers, 1999.