Constructing conditional plans by a theorem-prover

Journal of Artificial Intelligence Research

Volumn 10, Issue , 1999, Pages 323-352

  Rintanen, Jussi ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; POLYNOMIALS; THEOREM PROVING;

AUTOMATED PLANNING; CONDITIONAL PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 0033332766     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.591     Document Type: Article

References (21)

1. + planning. Computational Intelligence, 11(4), 625-655.
2. Balcázar, J. L., Díaz, I., & Gabarró, J. (1995). Structural Complexity I. Springer-Verlag, Berlin.
3. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 281-300.
4. Bryant, R. E. (1992). Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3), 293-318.
5. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), 165-204.
6. Cadoli, M., Giovanardi, A., & Schaerf, M. (1998). An algorithm to evaluate quantified Boolean formulae. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp. 262-267.
7. Cimatti, A., Roveri, M., & Traverso, P. (1998). Automatic OBDD-based generation of universal plans in non-deterministic domains. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp. 875-881.
8. Davis, M., Logemann, G., & Loveland, D. (1962). A machine program for theorem proving. Communications of the ACM, 5, 394-397.
9. Freeman, J. W. (1995). Improvements to Propositional Satisfiability Search Algorithms. Ph.D. thesis, University of Pennsylvania.
10. Gerevini, A., & Schubert, L. (1998). Inferring state constraints for domain-independent planning. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp. 905-912.
11. Green, C. (1969). Application of theorem-proving to problem solving. In Walker, D. E., & Norton, L. M. (Eds.), Proceedings of the 1st International Joint Conference on Artificial Intelligence, pp. 219-239 Washington, DC. William Kaufmann.
12. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Neumann, B. (Ed.), Proceedings of the 10th European Conference on Artificial Intelligence, pp. 359-363 Wien, Austria. John Wiley & Sons.
13. Kautz, H., & Selman, B. (1996). Pushing the envelope: planning, propositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pp. 1194-1201 Menlo Park, California. AAAI Press / The MIT Press.
14. Li, C. M., & Anbulagan (1997). Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 366-371 Nagoya, Japan.
15. McAllester, D. A., & Rosenblitt, D. (1991). Systematic nonlinear planning. In Dean, T. L., & McKeown, K. (Eds.), Proceedings of the 9th National Conference on Artificial Intelligence, pp. 634-639 Anaheim, California. The MIT Press.
16. Peot, M. A., & Smith, D. E. (1992). Conditional nonlinear planning. In Hendler, J. (Ed.), Proceedings of the First International Conference on Artificial Intelligence Planning Systems, pp. 189-197 San Mateo, California. Morgan Kaufmann Publishers.
17. Pryor, L., & Collins, G. (1996). Planning for contingencies: A decision-based approach. Journal of Artificial Intelligence Research, 4, 287-339.
18. Rintanen, J. (1998). A planning algorithm not based on directional search. In Cohn, A. G., Schubert, L. K., & Shapiro, S. C. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pp. 617-624 Trento, Italy. Morgan Kaufmann Publishers.
19. Rintanen, J. (1999). Improvements to the evaluation of quantified Boolean formulae. In Proceedings of the 16th International Joint Conference on Artificial Intelligence. Morgan Kaufmann Publishers. to appear.
20. Rosenschein, S. J. (1981). Plan synthesis: A logical perspective. In Hayes, P. J. (Ed.), Proceedings of the 7th International Joint Conference on Artificial Intelligence, pp. 331-337 Los Altos, California. William Kaufmann.
21. Smith, D. E., & Weld, D. S. (1998). Conformant Graphplan. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp. 889-896.