Challenges in bridging plan synthesis paradigms

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1997, Pages 44-49

  Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NEW APPROACHES; PLAN SYNTHESIS; PLANNING COMMUNITY;

ARTIFICIAL INTELLIGENCE;

PLANNING;

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

References (17)

1. Barrett, A. and Weld, D. 1994. Partial Order Planing: Evaluating possible efficiency gains. Artificial Intelligence, 67(1):71-112.
2. Bayardo, R and Schrag, R. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proc. AAAI-97.
3. Blum, A. and Furst, M. 1995. Fast planning through plan-graph analysis. In Proc. IJCAI-95.
4. Crawford, J. and Auton, L. 1996. Experimental results on the crossover point in random 3SAT. Artificial Intelligence, 81.
5. Ginsberg, M. 1996. A new algorithm for generative planning. In Proc. KR-96.
6. Joslin, D and Pollack, M. 1996. Is least commitment always a good idea? In Proc. AAAI-96.
7. Kambhampati, S. and Srivastava, B. 1996. Unifying classical planning approaches. ASU CSE TR 96-006. (Preliminary version appeared in Proc. 3rd European workshop on planning).
8. Kambhampati, S., Knoblock, C, and Yang, Q. 1995. Planning as refinement search: A unified framework for evaluating design tradeoffs in partial order planning. Artificial Intelligence, 76(1-2): 167-238.
9. Kambhampati, S. and Yang, X. 1996. On the role of disjunctive representations and constraint propagation in refinement planning. In Proc. KR-96.
10. Kambhampati, S and Lambrecht, E. 1997. Why does Graphplan work? ASU CSE TR 97-005. (Poster at IJCAI-97)
11. Kambhampati, S. 1997. Refinement planning as a unifying framework for plan synthesis. AI Magazine. Summer issue.
12. Kautz, H. and Selman, B. 1996. Pushing the envelope: Planning Propositional Logic and Stochastic Search. In Proc. AAAI-96.
13. Kautz, H., McAllester, D. and Selman, B. 1996. Encoding plans in propositional logic. In Proc. KR-96.
14. Muscettola, N. 1993. HSTS: Integrating planning and Scheduling. In: Intelligent Scheduling. M. Fox and M. Zweben (eds). Morgan Kaufmann.
15. Pearl,J.Heuristics. Addison-Wesley. 1984.
16. Selman, B., Levesque, H.J., and Mitchell, D. 1992. GSAT: a new method for solving hard satisfiability problems. In Proc. AAAI-92.
17. Selman, B., Kautz, H. and McAllester, D. 1997. Computational challenges in propositional reasoning and search. In Proc. IJCAI-97.