The complexity of optimal planning and a more efficient method for finding solutions

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 280-287

  Ray, Katrina ^a   Ginsberg, Matthew L ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT METHODS; OPTIMAL PLANNING; ORDER OF MAGNITUDES; POLYNOMIAL BOUNDS; RELATIVE COMPLEXITY; SAT SOLVERS; SATISFIABILITY; THEORETICAL FRAMEWORKS;

DECISION THEORY; OPTIMIZATION; SCHEDULING;

PLANNING;

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

References (13)

1. Bylander, Tom. 1991. Complexity Results for Planning. International Joint Conference on Artificial Intelligence.
2. Cadoli, Marco; Giovanardi, Andrea; Schaerf, Marco. 1998. An Algorithm to Evaluate Quantified Boolean Formulae. American Association for Artificial Intelligence (AAAI).
3. Davis, M.; Logemann, G.; Loveland, D. 1962. A Machine Program for Theorem Proving. Communications of the ACM Volume 5 Issue 7, pages 394-397.
4. Davis, M.; Putnam, H. 1960. A Computing Procedure for Quantification Theory. Journal of the ACM 7, 1:201-215.
5. th International Conference on Principles and Practice of Constraint Programming.
6. Kautz, Henry; McAllester, David; Selman Bart. 1996. Encoding Plans in Propositional Logic. Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning.
7. Kautz, Henry; Selman, Bart. 1992. Planning as Satisfiability. Proceedings of European Conference on Artificial Intelligence.
8. Kautz, Henry; Selman, Bart; Hoffman, Joerg. 2006. Satplan: Planning as Satisfiability Abstracts of the 5th International Planning Competition.
9. Krentel, M. The Complexity of Optimization Problems. 1988. Journal of Computer and System Sciences, 36:490-509.
10. Moskewicz, Matthew W.; Madigan, Conor F.; Zhao, Ying; Zhang, Lintao; Malik, Shared. 2001. Chaff: Engineering an Efficient SAT Solver. Proceedings of the Design Automation Conference.
11. th International Conference on Automated Planning and Scheduling.
12. Pipatsrisawat, K.; Darwiche, A. 2007. RSat 2.0: SAT Solver Description. Technical report D153. Automated Reasoning Group, Computer Science Department, University of California, Los Angeles.
13. th International Conference on Computer Aided Deduction.