On the nature and role of modal truth criteria in planning

Artificial Intelligence

Volumn 82, Issue 1-2, 1996, Pages 129-155

  Kambhampati, Subbarao ^a   Dana S, Nau ^b  

^a Arizona State University   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; LEARNING SYSTEMS; PLANNING;

MODAL CONDITIONAL TRUTH; MODAL TRUTH CRITERIA; POLYNOMIAL TIME;

ARTIFICIAL INTELLIGENCE;

EID: 0030124190     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)00095-6     Document Type: Article

References (36)

1. C. Bäckström, Finding least-constrained plans and optimal parallel executions is harder than we thought, in: Proceedings 2nd European Workshop on Planning (1993).
2. D. Chapman, Planning for conjunctive goals, Artif. Inrell. 32 (1987) 333-379.
3. K. Currie and A. Tate, O-Plan: the open planning architecture, Artif. Intell. 52 (1991) 49-86.
4. E. Davis, Representations of Commonsense Knowledge (Morgan Kaufmann, San Mateo, CA).
5. T. Dean and M. Boddy, Reasoning about partially ordered events, Artif. Intell. 36 (1988) 375-399.
6. M. Drummond, Private communication, 1991.
7. K. Erol, D. Nau and V.S. Subrahmanian, When is planning decidable?, in: Proceedings First International Conference AI Planning Systems (1992) 222-227.
8. K. Erol, D.S. Nau and V.S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning, Artif. Intell. 76 (1995) 75-88.
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
10. M.L. Ginsberg, What is a modal truth criterion?, Unpublished manuscript (1990).
11. N. Gupta and D.S. Nau, On the complexity of blocks-world planning, Artif. Intell. 56 (1992) 223-254.
12. S. Hanks and D.S. Weld, Systematic adaptation for case-based planning, in: Proceedings First International Conference AI Planning Systems (1992) 96-105.
13. E. Jacopin, C. Le Pape and J.F. Puget, A theoretical analysis of the "uselessness" of white-knights, Tech. Rept. 92/27, Institut Blaise Pascal (1992).
14. S. Kambhampati, On the utility of systematicity: Understanding tradeoffs between redundancy and commitment in partial ordering planning, in: Proceedings IJCAI-93, Chambery, France (1993).
15. S. Kambhampati, Multi-contributor causal structures for planning: a formalization and evaluation, Artif. Intell. 69 (1994) 235-278.
16. S. Kambhampati, Refinement search as a unifying framework for analyzing planning algorithms, in: Proceedings 4th International Conference on Principles of Knowledge Representation and Reasoning, Bonn (1994).
17. S. Kambhampati and J. Chen, Relative utility of EBG based plan reuse in total ordering vs. partial ordering planning, in: Proceedings AAAI-93, Washington, DC (1993).
18. S. Kambhampati and S. Kedar, Explanation-based generalization of partially ordered plans, in: Proceedings AAAI-91, Anaheim, CA (1991) 679-685.
19. S. Kambhampati and S. Kedar, A unified framework for explanation-based generalization of partially ordered and partially instantiated plans, Artif. Intell. 67 (1994) 29-70.
20. S. Kambhampati, C.A. Knoblock and Q. Yang, Planning as refinement search: a unified framework for evaluating design tradeoffs in partial order planning, Artif. Intell. 76 (1995) 167-238.
21. C.A. Knoblock, Generating parallel execution plans with a partial-order planner, in: Proceedings AIPS-94 (1994).
22. D. McAllester and D. Rosenblitt, Systematic nonlinear planning, in: Proceedings AAAI-91, Anaheim, CA (1991) 634-639.
23. D. McDermott, Regression planning, Int. J. Intelligent Systems 6 (1991) 357-416.
24. S. Minton, M. Drummond, J. Bresina and A. Philips, Total order vs. partial order planning: factors influencing performance, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992).
25. D. Nau, On the complexity of possible truth, in: Proceedings AAAI Spring Symposium, Stanford, CA (1993).
26. B. Nebel and C. Bäckström, On the computational complexity of temporal projection, planning and plan validation, Artif. Intell. 66 (1994) 125-160.
27. E.P.D. Pednault, Synthesizing plans that contain actions with context-dependent effects, Comput. Intell. 4 (1988) 356-372.
28. E.P.D. Pednault, Generalizing nonlinear planning to handle complex goals and actions with context-dependent effects, in: Proceedings IJCAI-91, Sydney, Australia (1991).
29. V. Pratt, Semantical considerations on Floyd-Hoare logic, in: Proceedings 17th Annual Symposium on Foundations of Computer Science, Houston, TX (1977) 109-121.
30. J.S. Penberthy and D.S. Weld, UCPOP: a sound, complete, partial order planner for ADL, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992).
31. M.A. Peot, Conditional nonlinear planning, in: Proceedings First International Conference on AI Planning Systems (1992) 189-197.
32. S. Rosenschein, Plan synthesis: a logical perspective, in: Proceedings UCAI-81, Vancouver, BC (1981) 331-337.
33. A. Tate, Generating project networks, in: Proceedings IJCAI-77, Cambridge, MA (1977) 888-893.
34. M.M. Veloso, M.A. Perez and J.G. Carbonell, Nonlinear planning with parallel resource allocation, in: Proceedings Workshop on Innovative Approaches to Planning, Scheduling and Control (1990) 207-212.
35. M.M. Veloso, Learning by analogical reasoning in general problem solving, Ph.D. thesis (CMU-CS-92-174), Carnegie-Mellon University, Pittsburgh, PA (1992).
36. Q. Yang and J.D. Tenenberg, Abtweak: abstracting a nonlinear, least commitment planner, in: Proceedings AAAI-90, Boston, MA (1990) 204-209.