Planning as satisfiability: Heuristics

Artificial Intelligence

Volumn 193, Issue , 2012, Pages 45-86

  Rintanen, Jussi ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Heuristics; Planning; SAT

Indexed keywords

COMBINATORIAL PROBLEM; HEURISTIC SEARCH ALGORITHMS; HEURISTICS; PROBLEM INSTANCES; SAT; SAT SOLVERS; SAT-SOLVING; SATISFIABILITY; SEARCH METHOD; STATE-SPACE; VARIABLE SELECTION;

ARTIFICIAL INTELLIGENCE; BENCHMARKING; HEURISTIC ALGORITHMS; PLANNING;

FORMAL LOGIC;

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

References (71)

1. H. Kautz, and B. Selman Planning as satisfiability B. Neumann, Proceedings of the 10th European Conference on Artificial Intelligence 1992 John Wiley & Sons 359 363
2. S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151-158.
3. H. Kautz, and B. Selman 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 1996 AAAI Press 1194 1201
4. A. Biere, A. Cimatti, E.M. Clarke, and Y. Zhu Symbolic model checking without BDDs W.R. Cleaveland, Tools and Algorithms for the Construction and Analysis of Systems, Proceedings of 5th International Conference, TACAS99 Lecture Notes in Computer Science vol. 1579 1999 Springer-Verlag 193 207
5. J.P. Marques-Silva, and K.A. Sakallah GRASP: a search algorithm for propositional satisfiability IEEE Transactions on Computers 48 1999 506 521
6. R.J. Bayardo Jr., R.C. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97) and 9th Innovative Applications of Artificial Intelligence Conference (IAAI-97), pp. 203-208.
7. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik Chaff: engineering an efficient SAT solver Proceedings of the 38th ACM/IEEE Design Automation Conference (DAC01) 2001 ACM Press 530 535 (Pubitemid 32841010)
8. B. Bonet, and H. Geffner Planning as heuristic search Artificial Intelligence 129 2001 5 33 (Pubitemid 32498414)
9. A. Grastien, Anbulagan, J. Rintanen, and E. Kelareva Diagnosis of discrete-event systems using satisfiability algorithms Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07) 2007 AAAI Press 305 310 (Pubitemid 350149590)
10. A. Porco, A. Machado, B. Bonet, Automatic polytime reductions of NP problems into a fragment of STRIPS, in: ICAPS 2011. Proceedings of the Twenty-First International Conference on Automated Planning and Scheduling, pp. 178-185.
11. J. Rintanen Phase transitions in classical planning: an experimental study D. Dubois, C.A. Welty, M.-A. Williams, Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004) 2004 AAAI Press 710 719
12. J. Rintanen, K. Heljanko, and I. Niemelä Planning as satisfiability: parallel plans and algorithms for plan search Artificial Intelligence 170 2006 1031 1080 (Pubitemid 44537214)
13. A.L. Blum, and M.L. Furst Fast planning through planning graph analysis Artificial Intelligence 90 1997 281 300 (Pubitemid 127398372)
14. B. Selman, H.A. Kautz, and B. Cohen Noise strategies for improving local search Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-2004) and the 16th Conference on Innovative Applications of Artificial Intelligence (IAAI-2004) 1994 AAAI Press 337 343
15. B. Selman, H.A. Kautz, B. Cohen, Local search strategies for satisfiability testing, in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 25, 1996, pp. 521-531.
16. J.M. Crawford, and L.D. Auton Experimental results on the crossover point in random 3-SAT Artificial Intelligence 81 1996 31 57 (Pubitemid 126349548)
17. B. Bonet, G. Loerincs, and H. Geffner A robust and fast action selection mechanism for planning Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97) and 9th Innovative Applications of Artificial Intelligence Conference (IAAI-97) 1997 AAAI Press 714 719
18. J. Rintanen Evaluation strategies for planning as satisfiability R. López de Mántaras, L. Saitta, ECAI 2004. Proceedings of the 16th European Conference on Artificial Intelligence 2004 IOS Press 682 687
19. J. Rintanen, K. Heljanko, and I. Niemelä Parallel encodings of classical planning as satisfiability J.J. Alferes, J. Leite, Logics in Artificial Intelligence: 9th European Conference, JELIA 2004. Proceedings Lisbon, Portugal, September 27-30, 2004 Lecture Notes in Computer Science vol. 3229 2004 Springer-Verlag 307 319 (Pubitemid 41049944)
20. C.M. Li, and Anbulagan Heuristics based on unit propagation for satisfiability problems M. Pollack, Proceedings of the 15th International Joint Conference on Artificial Intelligence 1997 Morgan Kaufmann Publishers 366 371
21. J. Rintanen A planning algorithm not based on directional search A.G. Cohn, L.K. Schubert, S.C. Shapiro, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR98) 1998 Morgan Kaufmann Publishers 617 624
22. M. Davis, G. Logemann, and D. Loveland A machine program for theorem proving Communications of the ACM 5 1962 394 397
23. J. Rintanen Heuristics for planning with SAT D. Cohen, Principles and Practice of Constraint Programming - CP 2010, 16th International Conference, CP 2010, Proceedings St. Andrews, Scotland, September 2010 Lecture Notes in Computer Science vol. 6308 2010 Springer-Verlag 414 428
24. M. Wehrle, and J. Rintanen Planning as satisfiability with relaxed step plans M. Orgun, J. Thornton, PAI 2007: Advances in Artificial Intelligence: 20th Australian Joint Conference on Artificial Intelligence, Proceedings Surfers Paradise, Gold Coast, Australia, December 2-6, 2007 Lecture Notes in Computer Science vol. 4830 2007 244 253
25. S. Ogata, T. Tsuchiya, and T. Kikuno SAT-based verification of safe Petri nets F. Wang, Automated Technology for Verification and Analysis: Second International Conference ATVA 2004, Proceedings Taipei, Taiwan, ROC, October 31-November 3, 2004 Lecture Notes in Computer Science vol. 3299 2004 Springer-Verlag 79 92 (Pubitemid 39742444)
26. A. Gerevini, and L. Schubert Inferring state constraints for domain-independent planning Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98) 1998 AAAI Press 905 912
27. P. Beame, H. Kautz, and A. Sabharwal Towards understanding and harnessing the potential of clause learning Journal of Artificial Intelligence Research 22 2004 319 351 (Pubitemid 41525889)
28. D.G. Mitchell A SAT solver primer EATCS Bulletin 85 2005 112 133
29. C.P. Gomes, B. Selman, N. Crato, and H. Kautz Heavy-tailed phenomena in satisfiability and constraint satisfaction problems Journal of Automated Reasoning 24 2000 67 100 (Pubitemid 30576096)
30. C.P. Gomes, B. Selman, and H. Kautz Boosting combinatorial search through randomization Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97) and 9th Innovative Applications of Artificial Intelligence Conference (IAAI-97) 1998 AAAI Press 431 437
31. J. Rintanen Regression for classical and nondeterministic planning M. Ghallab, C.D. Spyropoulos, N. Fakotakis, ECAI 2008. Proceedings of the 18th European Conference on Artificial Intelligence 2008 IOS Press 568 571
32. J. Rintanen Engineering efficient planners with SAT ECAI 2012. Proceedings of the 20th European Conference on Artificial Intelligence 2012 IOS Press 684 689
33. K. Pipatsrisawat, and A. Darwiche A lightweight component caching scheme for satisfiability solvers J. Marques-Silva, K.A. Sakallah, Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT-2007) Lecture Notes in Computer Science vol. 4501 2007 Springer-Verlag 294 299
34. E. Zarpas Simple yet efficient improvements of SAT based bounded model checking A.J. Hu, A.K. Martin, Formal Methods in Computer-Aided Design: 5th International Conference, FMCAD 2004, Proceedings Austin, Texas, USA, November 15-17, 2004 Lecture Notes in Computer Science vol. 3312 2004 Springer-Verlag 174 185 (Pubitemid 39749975)
35. M. Streeter, S.F. Smith, Using decision procedures efficiently for optimization, in: M. Boddy, M. Fox, S. Thiébaux (Eds.), ICAPS 2007. Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, pp. 312-319.
36. D. McDermott, The planning domain definition language, Technical Report CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, Yale University, 1998.
37. J. Rintanen Heuristics for planning with SAT and expressive action definitions ICAPS 2011. Proceedings of the Twenty-First International Conference on Automated Planning and Scheduling 2011 AAAI Press 210 217
38. A. Gerevini, and I. Serina Planning as propositional CSP: from Walksat to local search techniques for action graphs Constraints Journal 8 2003 389 413
39. H. Kautz, and B. Selman Unifying SAT-based and graph-based planning T. Dean, Proceedings of the 16th International Joint Conference on Artificial Intelligence 1999 Morgan Kaufmann Publishers 318 325
40. S. Richter, and M. Westphal The LAMA planner: guiding cost-based anytime planning with landmarks Journal of Artificial Intelligence Research 39 2010 127 177
41. ICAPS, http://www.icaps-conference.org/, 2010.
42. T. Bylander A probabilistic analysis of propositional STRIPS planning Artificial Intelligence 81 1996 241 271 (Pubitemid 126349557)
43. J. Rintanen, Generation of hard solvable planning problems, Technical Report TR-CS-12-03, Research School of Computer Science, The Australian National University, 2012.
44. B.A. Huberman, R.M. Lukose, and T. Hogg An economics approach to hard computational problems Science 275 1997 51 54 (Pubitemid 27020302)
45. C.P. Gomes, and B. Selman Algorithm portfolio design: theory vs. practice Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI-97) 1997 Morgan Kaufmann Publishers 190 197
46. C.P. Gomes, and B. Selman Algorithm portfolios Journal of Artificial Intelligence Research 126 2001 43 62 (Pubitemid 32196231)
47. J. Hoffmann, and B. Nebel The FF planning system: fast plan generation through heuristic search Journal of Artificial Intelligence Research 14 2001 253 302
48. V. Vidal A lookahead strategy for heuristic search planning S. Zilberstein, J. Koehler, S. Koenig, ICAPS 2004. Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling 2004 AAAI Press 150 160
49. P. Cheeseman, B. Kanefsky, and W.M. Taylor Where the really hard problems are J. Mylopoulos, Proceedings of the 12th International Joint Conference on Artificial Intelligence 1991 Morgan Kaufmann Publishers 331 337
50. D. Mitchell, B. Selman, and H. Levesque Hard and easy distributions of SAT problems W. Swartout, Proceedings of the 10th National Conference on Artificial Intelligence 1992 The MIT Press 459 465 (Pubitemid 23633548)
51. B. Bollobás Random Graphs 1985 Academic Press
52. L. Ryan, Efficient algorithms for clause-learning SAT solvers, Masters thesis, Simon Fraser University, 2003.
53. A. Sideris, and Y. Dimopoulos Constraint propagation in propositional planning ICAPS 2010. Proceedings of the Twentieth International Conference on Automated Planning and Scheduling 2010 AAAI Press 153 160
54. N. Robinson, C. Gretton, D.-N. Pham, and A. Sattar SAT-based parallel planning using a split representation of actions A. Gerevini, A. Howe, A. Cesta, I. Refanidis, ICAPS 2009. Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling 2009 AAAI Press 281 288
55. K. Ray, M.L. Ginsberg, The complexity of optimal planning and a more efficient method for finding solutions, in: J. Rintanen, B. Nebel, J.C. Beck, E. Hansen (Eds.), ICAPS 2008. Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, pp. 280-287.
56. R. Huang, Y. Chen, W. Zhang, A novel transition based encoding scheme for planning as satisfiability, in: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-10), pp. 89-94.
57. J. Rintanen Planning and SAT A. Biere, M.J.H. Heule, H. van Maaren, T. Walsh, Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications vol. 185 2009 IOS Press 483 504
58. A. Cimatti, E. Giunchiglia, F. Giunchiglia, and P. Traverso Planning via model checking: a decision procedure for AR S. Steel, R. Alami, Recent Advances in AI Planning. Fourth European Conference on Planning (ECP97) Lecture Notes in Computer Science vol. 1348 1997 Springer-Verlag 130 142
59. V. Vidal, and H. Geffner Branching and pruning: an optimal temporal POCL planner based on constraint programming Artificial Intelligence 170 2006 298 335 (Pubitemid 43134175)
60. D.A. McAllester, and D. Rosenblitt Systematic nonlinear planning Proceedings of the 9th National Conference on Artificial Intelligence vol. 2 1991 AAAI Press/The MIT Press 634 639
61. J. Pearl Heuristics: Intelligent Search Strategies for Computer Problem Solving 1984 Addison-Wesley Publishing Company
62. N. Lipovetzky, H. Geffner, Inference and decomposition in planning using causal consistent chains, in: A. Gerevini, A. Howe, A. Cesta, I. Refanidis (Eds.), ICAPS 2009. Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling, pp. 217-224.
63. A. Haken The intractability of resolution Theoretical Computer Science 39 1985 297 308
64. M. Järvisalo, and T. Junttila Limitations of restricted branching in clause learning Constraints Journal 14 2009 325 356
65. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani The MathSAT 3 system Automated Deduction - CADE-20 Lecture Notes in Computer Science vol. 3632 2005 Springer-Verlag 315 321
66. G. Audemard, A. Cimatti, A. Kornilowicz, and R. Sebastiani Bounded model checking for timed systems Formal Techniques for Networked and Distributed Systems - FORTE 2002 Lecture Notes in Computer Science vol. 2529 2002 Springer-Verlag 243 259
67. N. Giorgetti, G.J. Pappas, and A. Bemporad Bounded model checking of hybrid dynamical systems Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005 2005 IEEE 672 677 (Pubitemid 46297044)
68. G. Audemard, M. Bozzano, A. Cimatti, and R. Sebastiani Verifying industrial hybrid systems with MathSAT Electronic Notes in Theoretical Computer Science 119 2005 17 32 (Pubitemid 40319809)
69. J. Rintanen Constructing conditional plans by a theorem-prover Journal of Artificial Intelligence Research 10 1999 323 352 (Pubitemid 30573906)
70. J. Rintanen Asymptotically optimal encodings of conformant planning in QBF Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07) 2007 AAAI Press 1045 1050 (Pubitemid 350149707)
71. S.M. Majercik, and M.L. Littman Contingent planning under uncertainty via stochastic satisfiability Artificial Intelligence 147 2003 119 162