Planning with specialized SAT solvers

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1563-1566

  Rintanen, Jussi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL CORE; SAT SOLVERS; SEARCH METHOD; STATE-SPACE; SUB-AREAS;

ARTIFICIAL INTELLIGENCE;

KNOWLEDGE REPRESENTATION;

EID: 80055030863     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33. (Pubitemid 32498414)
2. Huang, Y.-C.; Selman, B.; and Kautz, H. 1999. 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), 511-517. AAAI Press.
3. Kautz, H., and Selman, B. 1996. 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, 1194-1201. AAAI Press.
4. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: engineering an efficient SAT solver. In Proceedings of the 38th ACM/IEEE Design Automation Conference (DAC'01), 530-535. ACM Press.
5. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08), 975-982. AAAI Press.
6. Rintanen, J.; Heljanko, K.; and Niemelä, I. 2006. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence 170(12-13):1031-1080. (Pubitemid 44537214)
7. Rintanen, J. 2003. Symmetry reduction for SAT representations of transition systems. In Giunchiglia, E.; Muscettola, N.; and Nau, D., eds., Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, 32-40. AAAI Press.
8. Rintanen, J. 2004. 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, 682-687. IOS Press.
9. Rintanen, J. 2011a. Heuristics for planning with SAT and expressive action definitions. In ICAPS 2011. Proceedings of the Twenty-First International Conference on Automated Planning and Scheduling. AAAI Press, to appear.
10. Rintanen, J. 2011b. Planning with SAT, admissible heuristics and A*. In Walsh, T., ed., Proceedings of the 22th International Joint Conference on Artificial Intelligence. AAAI Press, to appear.
11. Rintanen, J. 2010. Heuristics for planning with SAT. In Cohen, D., ed., Principles and Practice of Constraint Programming - CP 2010, 16th International Conference, CP 2010, St. Andrews, Scotland, September 2010, Proceedings., number 6308 in Lecture Notes in Computer Science, 414-428. Springer-Verlag.
12. Rintanen, J. 2010. Heuristic planning with SAT: beyond uninformed depth-first search. In Li, J., ed., AI 2010: Advances in Artificial Intelligence: 23rd Australasian Joint Conference on Artificial Intelligence, Adelaide, South Australia, December 7-10, 2010, Proceedings, number 6464 in Lecture Notes in Computer Science, 415-424. Springer-Verlag.
13. Vidal, V. 2004. A lookahead strategy for heuristic search planning. In Zilberstein, S.; Koehler, J.; and Koenig, S., eds., ICAPS 2004. Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, 150-160. AAAI Press.