Pruning conformant plans by counting models on compiled d-DNNF representations

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 141-150

  Palacios, Héctor ^a   Darwiche, Adnan ^b   Bonet, Blai ^c   Geffner, Hector ^d  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

^d INSTITUCIÓ CATALANA DE RECERCA I ESTUDIS AVANÇATS ICREA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; CONFORMANT PLANNING; COUNTING MODELS; EQUIVALENT THEORY; PLANNING TASKS; POTENTIAL BENEFITS; SATISFYING ASSIGNMENTS; STRONGEST CONSEQUENCE;

PLANNING;

ENCODING (SYMBOLS);

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

References (27)

1. Barwise, J., ed. 1977. Handbook of Mathematical Logic. North-Holland.
2. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. Proc. 6th Int. Conf. on Artificial Intelligence Planning and Scheduling, 52-61. AAAI Press.
3. Brafman, R. and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. Proc. 14th Int. Conf. on Automated Planning and Scheduling. AAAI Press.
4. Bryant, R. E. 1992. Symbolic boolean manipulation with ordered bynaru-decision diagrams. ACM Computing Surveys 24(3):293-318.
5. Cadoli, M. and Donini, F. 1997. A survey on knowledge compilation. AI Communications 10(3-4): 137-150.
6. Cimatti, A.; Roveri, M.; and Bertoli, P. 2004. Conformant planning via symbolic model checking and heuristic search. Artificial Intelligence 159:127-206.
7. Clarke, E.; Grumberg, O.; and Peled, D. 1999. Model Checking. MIT Press.
8. Darwiche, A., and Marquis, P. 2002. A knowledge compilation map. J. of Artificial Int. Research 17:229-264.
9. Darwiche, A. 2001. Decomposable negation normal form. J. of the ACM 48(4):608-647.
10. Darwiche, A. 2002. On the tractable counting of theory models and its applications to belief revision and truth maintenance. J. of Applied Non-Classical Logics.
11. Darwiche, A. 2004. New advances in compiling cnf into decomposable negation normal form. Proc. 16th European Conf. on Artificial Intelligence, 328-332.
12. IOS Press. Dechter, R. 2004. And/or search spaces for graphical models. Technical report, UC Irvine. ICS Technical Report 115, at http://www.ics.uci. edu/~csp/rll8.pdf.
13. Giunchiglia, F. and Traverso, P. 1999. Planning as model checking. Proc. 5th European Conf. on Planning. Springer: LNCS 1809.
14. Giunchiglia, E.; Massarotto, A. and Sebastiani, R. 1998. Act, and the rest will follow: Exploiting determinism in planning as satisfiability. Proc. 15th Nat. Conf. on Artificial Intelligence, 948-953. AAAI Press.
15. Goldman, R. P. and Boddy, M. S. 1996. Expressive planning and explicit knowledge. Proc. 3rd Int. Conf. on Artificial Intelligence Planning Systems. AAAI Press.
16. Haslum, P. and Jonsson, P. 1999. Some results on the complexity of planning with incomplete information. Proc. 5th European Conf. on Planning, 308-318. Springer: LNCS 1809.
17. Huang, J. and Darwiche, A. 2004. Using DPLL for efficient OBDD construction. Proc. 7th Int. Conf. on Theory and Applications of Satisfiability Testing, 127-136.
18. Kautz, H. and Selman, B. 1996. Pushing the envelope: Planning, prepositional logic, and stochastic search. Proc. 13th Nat. Conf. on Artificial Intelligence, 1194-1201. AAAI Press.
19. Knuth, D. E. 1973. The Art of Computer Programming, Vol. Ill: Sorting and Searching. Addison-Wesley.
20. Lin, F. and Reiter, R. 1994. Forget it! Working Notes, AAAI Fall Symposium on Relevance, 154-159.
21. McMillan, K. L. 1994. Hiearchical representation of discrete functions with applications to model checking. Proc. 6th Int. Conf. on Computer Aided Verification.
22. Reiter, R. and de Kleer, J. 1987. Foundations of assumption-based truth maintenance systems: A preliminary report. Proc. 6th Nat. Conf. on Artificial Intelligence, 183-188. AAAI Press.
23. Rintanen, J. 1999. Constructing conditional plans by a theorem prover. J. of Artificial Int. Research 10:323-352.
24. Rintanen, J. 2004a. Complexity of planning with partial observability. Proc. 14th Int. Conf. on Automated Planning and Scheduling, 345-354. AAAI Press.
25. Rintanen, J. 2004b. Distance estimates for planning in the discrete belief space. Proc. 19th Nat. Conf. on Artificial Intelligence, 525-530. AAAI Press.
26. Selman, B. and Kautz, H. 1996. Knowledge compilation and theory approximation. J. of the ACM 43:193-224.
27. Smith, D. and Weld, D. 1998. Conformant graphplan. Proc. 15th Nat. Conf. on Artificial Intelligence, 889-896. AAAI Press.