On the Compilability and Expressive Power of Propositional Planning Formalisms

Journal of Artificial Intelligence Research

Volumn 12, Issue , 2000, Pages 271-

  Nebel, Bernhard ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (28)

1. Anderson, C. R., Smith, D. E., & Weld, D. S. (1998). Conditional effects in Graphplan. In Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AIPS-98), pp. 44-53. AAAI Press, Menlo Park.
2. Baader, F. (1990). A formal definition for expressive power of knowledge representation languages. In Proceedings of the 9th European Conference on Artificial Intelligence (ECAI-90) Stockholm, Sweden. Pitman.
3. Bäckström, C. (1995). Expressive equivalence of planning formalisms. Artificial Intelligence, 76(1-2), 17-34.
4. + planning. Computational Intelligence, 11(4), 625-655.
5. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 279-298.
6. Brewka, G., & Hertzberg, J. (1993). How to do things with worlds: On formalizing actions and plans.. Journal Logic and Computation, 3(5), 517-532.
7. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), 165-204.
8. Cadoli, M., & Donini, F. M. (1997). A survey on knowledge compilation. AI Communications, 10(3,4), 137-150.
9. Cadoli, M., Donini, F. M., Liberatore, P., & Schaerf, M. (1996). Comparing space efficiency of propositional knowledge representation formalism. In Aiello, L. C., Doyle, J., & Shapiro, S. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 5th International Conference (KR-96), pp. 364-373 Cambridge, MA. Morgan Kaufmann.
10. Erol, K., Hendler, J. A., & Nau, D. S. (1994). HTN planning: Complexity and expressivity. In Proceedings of the 12th National Conference of the American Association for Artificial Intelligence (AAAI-94), pp. 1123-1129 Seattle, WA. MIT Press.
11. Erol, K., Hendler, J. A., & Nau, D. S. (1996). Complexity results for hierarchical task-network planning. Annals of Mathematics and Artificial Intelligence, 18, 69-93.
12. Fikes, R. E., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2, 189-208.
13. Furst, M., Saxe, J. B., & Sipser, M. (1984). Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1), 13-27.
14. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
15. Gazen, B. C., & Knoblock, C. (1997). Combining the expressiveness of UCPOP with the efficiency of Graphplan. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, pp. 221-233 Toulouse, France. Springer-Verlag.
16. Gogic, G., Kautz, H. A., Papadimitriou, C. H., & Selman, B. (1995). The comparative linguistics of knowledge representation. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 862-869 Montreal, Canada. Morgan Kaufmann.
17. Kambhampati, S., Parker, E., & Lambrecht, E. (1997). Understanding and extending Graphplan. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, pp. 260-272 Toulouse, France. Springer-Verlag.
18. Karp, R. M., & Lipton, R. J. (1982). Turing machines that take advice. L' Ensignement Mathématique, 28, 191-210.
19. Kautz, H. A., McAllester, D. A., & Selman, B. (1996). Encoding plans in prepositional logic. In Aiello, L. C., Doyle, J., & Shapiro, S. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 5th International Conference (KR-96), pp. 374-385 Cambridge, MA. Morgan Kaufmann.
20. Kautz, H. A., & Selman, B. (1992). Forming concepts for fast inference.. In Proceedings of the 10th National Conference of the American Association for Artificial Intelligence (AAAI-92), pp. 786-793 San Jose, CA. MIT Press.
21. Kautz, H. A., & Selman, B. (1996). Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proceedings of the 13th National Conference of the American Association for Artificial Intelligence (AAAI-96), pp. 1194-1201. MIT Press.
22. Kautz, H. A., & Selman, B. (1998). BLACKBOX: A new approach to the application of theorem proving to problem solving. In Working notes of the AIPS'98 Workshop on Planning as Combinatorial Search Pittsburgh, PA.
23. Koehler, J., Nebel, B., Hoffmann, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, pp. 273-285 Toulouse, France. Springer-Verlag.
24. Lifschitz, V. (1986). On the semantics of STRIPS. In Georgeff, M. P., & Lansky, A. (Eds.), Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, pp. 1-9 Timberline, OR. Morgan Kaufmann.
25. Nebel, B. (1999). What is the expressive power of disjunctive preconditions?. In Biundo, S., & Fox, M. (Eds.), Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99) Durham, UK. Springer-Verlag. To appear.
26. Papadimitriou, C. H. (1994). Computational Complexity. Addison-Wesley, Reading, MA.
27. Pednault, E. P. (1989). ADL: Exploring the middle ground between STRIPS and the situation calculus. In Brachman, R., Levesque, H. J., & Reiter, R. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 1st International Conference (KR-89), pp. 324-331 Toronto, ON. Morgan Kaufmann.
28. Yap, C. K. (1983). Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26, 287-300.