Engineering efficient planners with SAT

Frontiers in Artificial Intelligence and Applications

Volumn 242, Issue , 2012, Pages 684-689

  Rintanen, Jussi ^a,b  

^a GRIFFITH UNIVERSITY   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

AI PLANNING; MEMORY REQUIREMENTS; MEMORY USE; PERFORMANCE; PLANNING PROBLEM; PLANNING SYSTEMS; SAT-BASED PLANNING; SEARCH METHOD; SIMPLE++; SOLUTION STRATEGY;

PLANNING;

EID: 84878780031     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-61499-098-7-684     Document Type: Conference Paper

References (25)

1. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu, 'Symbolic model checking without BDDs', in Tools and Algorithms for the Construction and Analysis of Systems, Proceedings of 5th International Conference, TACAS'99, ed., W. R. Cleaveland, volume 1579 of Lecture Notes in Computer Science, pp. 193-207. SpringerVerlag, (1999).
2. Blai Bonet and Héctor Geffner, 'Planning as heuristic search', Artificial Intelligence, 129(1-2), 5-33, (2001).
3. S. A. Cook, 'The complexity of theorem proving procedures', in Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151-158, (1971).
4. Jamers. M. Crawford and Andrew B. Baker, 'Experimental results on the application of satisfiability algorithms to scheduling problems', in Proceedings of the 10th National Conference on Artificial Intelligence, pp. 1092-1097, (1994).
5. Michael Ernst, Todd Millstein, and Daniel S. Weld, 'Automatic SAT-compilation of planning problems', in Proceedings of the 15th International Joint Conference on Artificial Intelligence, ed., Martha Pollack, pp. 1169-1176. Morgan Kaufmann Publishers, (1997).
6. P. Godefroid, 'Using partial orders to improve automatic verification methods', in Proceedings of the 2nd International Conference on Computer-Aided Verification (CAV '90), Rutgers, New Jersey, 1990, eds., Kim Guldstrand Larsen and Arne Skou, number 531 in Lecture Notes in Computer Science, pp. 176-185. Springer-Verlag, (1991).
7. Carla P. Gomes, Bart Selman, and Henry Kautz, 'Boosting combinatorial search through randomization', in Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97) and 9th Innovative Applications of Artificial Intelligence Conference (IAAI-97), pp. 431-437. AAAI Press, (1998).
8. Henry Kautz and Bart Selman, 'Planning as satisfiability', in Proceedings of the 10th European Conference on Artificial Intelligence, ed., Bernd Neumann, pp. 359-363. John Wiley & Sons, (1992).
9. Henry Kautz and Bart Selman, 'Pushing the envelope: planning, propo-sitional logic, and stochastic search', in Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pp. 1194-1201. AAAI Press, (1996).
10. Henry Kautz and Bart Selman, 'Unifying SAT-based and graph-based planning', in Proceedings of the 16th International Joint Conference on Artificial Intelligence, ed., Thomas Dean, pp. 318-325. Morgan Kaufmann Publishers, (1999).
11. T. Larrabee, 'Test pattern generation using Boolean satisfiability', Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11(1), 4-15, (1992).
12. Inês Lynce and João Marques-Silva, 'Efficient haplotype inference with boolean satisfiability', in Proceedings of the 21th National Conference on Artificial Intelligence (AAAI-2006), pp. 104-109. AAAI Press, (2006).
13. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik, 'Chaff: engineering an efficient SAT solver', in Proceedings of the 38th ACM/IEEE Design Automation Conference (DAC'01), pp. 530-535. ACM Press, (2001).
14. Cédric Pralet and Gérard Verfaillie, 'Slice encoding for constraint-based planning', in Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, CP 2009, ed., I. P. Gent, volume 5732 of Lecture Notes in Computer Science, pp. 669-683. Springer-Verlag, (2009).
15. Silvia Richter and Matthias Westphal, 'The LAMA planner: guiding cost-based anytime planning with landmarks', Journal of Artificial Intelligence Research, 39, 127-177, (2010).
16. Jussi Rintanen, 'A planning algorithm not based on directional search', in Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), eds., A. G. Cohn, L. K. Schubert, and S. C. Shapiro, pp. 617-624. Morgan Kaufmann Publishers, (1998).
17. Jussi Rintanen, 'Compact representation of sets of binary constraints', in ECAI 2006. Proceedings of the 17th European Conference on Artificial Intelligence, eds., Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, pp. 143-147. IOS Press, (2006).
18. Jussi Rintanen, 'Planning with specialized SAT solvers', in Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI-11), pp. 1563-1566. AAAI Press, (2011).
19. Jussi Rintanen, 'Heuristics for planning with SAT', in Principles and Practice of Constraint Programming - CP 2010, 16th International Conference, CP 2010, St. Andrews, Scotland, September 2010, Proceedings., ed., David Cohen, number 6308 in Lecture Notes in Computer Science, pp. 414-428. Springer-Verlag, (2010).
20. Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä, 'Planning as satisfiability: parallel plans and algorithms for plan search', Artificial Intelligence, 170(12-13), 1031-1080, (2006).
21. Nathan Robinson, Charles Gretton, Duc-Nghia Pham, and Abdul Sattar, 'SAT-based parallel planning using a split representation of actions', in ICAPS 2009. Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling, eds., Alfonso Gerevini, Adele Howe, Amedeo Cesta, and Ioannis Refanidis, pp. 281-288. AAAI Press, (2009).
22. Andreas Sideris and Yannis Dimopoulos, 'Constraint propagation in propositional planning', in ICAPS 2010. Proceedings of the Twentieth International Conference on Automated Planning and Scheduling, pp. 153-160. AAAI Press, (2010).
23. Alexander Smith, Andreas Veneris, Moayad Fahim Ali, and Anastasios Viglas, 'Fault diagnosis and logic debugging using Boolean satisfiability', Transactions on Computer-Aided Design of Integrated Circuits and Systems, 24(10), (2005).
24. Vincent Vidal, 'A lookahead strategy for heuristic search planning', in ICAPS 2004. Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, eds., Shlomo Zilberstein, Jana Koehler, and Sven Koenig, pp. 150-160. AAAI Press, (2004).
25. R. Glenn Wood and Rob A. Rutenbar, 'FPGA routing and routability estimation via Boolean satisfiability', IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 6(2), (1998).