Asymptotically optimal encodings of conformant planning in QBF

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1045-1050

  Rintanen, Jussi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; DECISION MAKING; LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION;

CONDITIONAL PLANNING; PLANNING PROBLEMS; QUANTIFIED BOOLEAN FORMULAE (QBF);

INTELLIGENT AGENTS;

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

References (15)

1. Biere, A. 2005. Resolve and expand. In Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, number 3542 in Lecture Notes in Computer Science, 59-70. Springer-Verlag.
2. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. In Chien, S.; Kambhampati, S.; and Knoblock, C. A., eds., Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 52-61. AAAI Press.
3. Brafman, R. I., and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. In Zilberstein, S.; Koehler, J.; and Koenig, S., eds., ICAPS 2004. Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, 355-364. AAAI Press.
4. Giunchiglia, E.; Narizzano, M.; and Tacchella, A. 2002. Learning for quantified Boolean logic satisfiability. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-2002) and the 14th Conference on Innovative Applications of Artificial Intelligence (IAAI-2002), 649-654.
5. Giunchiglia, E. 2000. Planning as satisfiability with expressive action languages: concurrency, constraints and nondeterminism. In Cohn, A. G.; Giunchiglia, F.; and Selman, B., eds., Principles of Knowledge Representation and Reasoning: Proceedings of the Seventh International Conference (KR 2000), 657-666. Morgan Kaufmann Publishers.
6. 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.
7. Knuth, D. E. 1998. Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley Publishing Company.
8. Palacios, H., and Geffner, H. 2005. Reducción de la planificación conformante a SAT mediante compilación a d-DNNF. In XI Conferencia de la Asociación Española para la Inteligencia Artificial. Also presented in an ICAPS'05 workshop as "Mapping conformant planning into SAT through compilation and projection".
9. Palacios, H.; Bonet, B.; Darwiche, A.; and Geffner, H. 2005. Pruning conformant plans by counting models on compiled d-DNNF representations. In Biundo, S.; Myers, K.; and Rajan, K., eds., ICAPS 2005. Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling, 141-150. AAAI Press.
10. 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.
11. Rintanen, J. 1999. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10:323-352.
12. Rintanen, J. 2003. Expressive equivalence of formalisms for planning with sensing. In Giunchiglia, E.; Muscettola, N.; and Nau, D., eds., Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, 185-184. AAAI Press.
13. Rintanen, J. 2004. Distance estimates for planning in the discrete belief space. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-2004) and the 16th Conference on Innovative Applications of Artificial Intelligence (IAAI-2004), 525-530. AAAI Press.
14. Russell, S., and Wolfe, J. 2005. Efficient belief-state ANDOR search, with application to Kriegspiel. In Kaelbling, L. P., ed., Proceedings of the 19th International Joint Conference on Artificial Intelligence, 278-285. Morgan Kaufmann Publishers.
15. Zhang, L., and Malik, S. 2002. Conflict driven learning in a quantified Boolean satisfiability solver. In Proceedings of the 2002 IEEE/ACM International Conference on Computer Aided Design (ICCAD2002), 442-448. ACM Press.