The logical foundations of goal-regression planning in autonomous agents

Artificial Intelligence

Volumn 106, Issue 2, 1998, Pages 267-334

  Pollock, John L ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

Autonomous agents; Defeasible reasoning; Goal regression; OSCAR; Planning

Indexed keywords

COMPUTATIONAL LINGUISTICS; REGRESSION ANALYSIS;

GOAL-REGRESSION PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 0032317829     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(98)00100-3     Document Type: Article

References (46)

1. J. Allen, Formal models of planning, in: J. Allen, J. Hendler, A. Tate (Eds.), Readings in Planning, Morgan Kaufmann, Los Altos, CA, 1987.
2. A. Barrett, D. Weld, Partial order planning: evaluating possible efficiency gains, Artificial Intelligence 67 (1994) 71-112.
3. A. Blum, M.L. Furst, Fast planning through planning graph analysis, in: Proc. IJCAI-95, Montreal, Quebec, 1995, pp. 1636-1642.
4. A. Blum, M.L. Furst, Fast planning through planning graph analysis. Artificial Intelligence 90 (1997) 281-300.
5. R.I. Brafman, H. Hoos, C. Boutilier, LPSP: a linear plan-level stochastic planner, Technical Report FC 98-06, Department of Math and Computer Science, Ben-Gurion University; available from http: //www.cs.ubc.ca/spider/cebly/craig.html, 1998.
6. D. Chapman, Planning for conjunctive goals, Artificial Intelligence 32 (1987) 333-377.
7. K. Erol, D.S. Nau, V.S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning, Artificial Intelligence 76 (1975) 75-88.
8. O. Etzioni, S. Hanks, D. Weld, D. Draper, N. Lesh, M. Williamson, An approach to planning with incomplete information, in: Proc. 3rd International Conference on the Principles of Knowledge Representation and Reasoning, Cambridge, MA, 1992, pp. 115-125.
9. G. Ferguson, J. Allen, Arguing about plans: plan representation and reasoning for mixed-initiative planning, in: Proc. 2nd International Conference on AI Planning Systems, 1994.
10. R.E. Fikes, N.J. Nilsson, STRIPS: a new approach to the application of theorem proving to problem solving. Artificial Intelligence 2 (1971) 189-208.
11. A. Gerevini, L. Schubert, Accelerating partial-order planners: some techniques for effective search control and pruning, J. Artificial Intelligence Res. 5 (1996) 95-137.
12. M. Ginsberg, Approximate planning, Artificial Intelligence 76 (1995) 89-124.
13. R.P. Goldman, M.S. Boddy, Conditional linear planning, in: Proc. 2nd International Conference on Artificial Intelligence Planning Systems, 1994, pp. 80-85.
14. N. Goodman, Fact, Fiction, and Forecast, Harvard University Press, Cambridge, MA, 1955.
15. S. Hanks, D. McDermott, Default reasoning, nonmonotonic logics, and the Frame Problem, in: Proc. AAAI-86, Philadelphia, PA, 1986.
16. S. Hanks, D. McDermott, Nonmonotonic logic and temporal projection, Artificial Intelligence 33 (1987) 379-412.
17. D. Joslin, M. Pollack, Least-cost flaw repair: a plan-refinement strategy for partial-order planning, in: Proc. AAAI-94, Seatle, WA, 1994, pp. 1004-1009.
18. D. Joslin, M. Pollack, Passive and active decision postponement in plan generation, in: Proc. 3rd European Workshop and Planning, 1995.
19. H.A. Kautz, The logic of persistence, in: Proc. AAAI-86, Philadelphia, PA, 1986, pp. 401-405.
20. H.A. Kautz, B. Selman, Pushing the envelope: planning, propositional logic, and stochastic search, in: Proc. AAAI-96, Portland, OR, 1996, pp. 1194-1201.
21. N. Kushmerick, S. Hanks, D.S. Weld, An algorithm for probabilistic planning, Artificial Intelligence 76 (1995) 239-286.
22. V. Lifschitz, Formal theories of action, in: F. Brown (Ed.), The Frame Problem in Artificial Intelligence, Proc. 1987 Workshop, Morgan Kaufmann, Los Altos, CA, 1987.
23. V. Lifschitz, On the semantics of STRIPS, in: M. Georgeff, A. Lansky (Eds.), Reasoning about Actions and Plans, Morgan Kaufmann, Los Altos, CA, 1987.
24. D. McAllester, D. Rosenblitt, Systematic nonlinear planning, in: Proc. AAAI-91, Anaheim, CA, 1991, pp. 634-639.
25. J. McCarthy, P. Hayes, Some philosophical problems from the standpoint of artificial intelligence, in: B. Meltzer, D. Michie (Eds.), Machine Intelligence 4, Edinburgh University Press, Edinburgh, 1969.
26. K. Myers, D. Smith, The persistence of derived information, in: Proc. AAAI-88, St. Paul, MN, 1988, pp. 496-500.
27. E.P. Pednault, Toward a mathematical theory of plan synthesis, Ph.D. Thesis, Stanford University, 1987.
28. J.S. Penberthy, D. Weld, UCPOP: a sound, complete, partial order planner for ADL, in: Proc. 3rd International Conference on the Principles of Knowledge Representation and Reasoning, Cambridge, MA, 1992, pp. 103-114.
29. M.A. Peot, D. Smith, Conditional nonlinear planning, in: Proc. 1st International Conference on Artificial Intelligence Planning Systems, 1992, pp. 189-197.
30. M.A. Peot, D. Smith, Threat removal strategies for partial-order planning, in: Proc. AAAI-93, Washington, DC, 1993, pp. 492-499.
31. M. Pollack, D. Joslin, M. Paolucci, Flaw selection strategies for partial-ordering planning, J. Artificial Intelligence Res. 6 (1997) 223-262.
32. J. Pollock, The logic of projectibility, Philosophy of Science 39 (1972) 302-314.
33. J. Pollock, Nomic Probability and the Foundations of Induction, Oxford University Press, 1990.
34. J. Pollock, Cognitive Carpentry, MIT Press, Cambridge, MA, 1995.
35. J. Pollock, Reason in a changing world, in: D.M. Gabbay, H.J. Ohlbach (Eds.), Practical Reasoning, Springer, Berlin, 1996, pp. 495-509; available from http: //www.u.arizona.edu/∼pollock/.
36. J. Pollock, Reasoning about change and persistence: a solution to the Frame Problem, Nous 31 (1997) 143-169.
37. J. Pollock, Reasoning defeasibly about plans, Technical Report of the OSCAR Project, 1998; available from http: //www.u.arizona.edu/∼pollock/.
38. J. Pollock, Perceiving and reasoning about a changing world, Computational Intelligence 14 (1998) 498-562.
39. L. Pryor, G. Collins, Planning for contingencies: a decision-based approach, J. Artificial Intelligence Res. 4 (1996) 287-339.
40. Y. Shoham, Time and causation from the standpoint of artificial intelligence, Computer Science Research Report No. 507, Yale University, New Haven, CT, 1986.
41. Y. Shoham, Reasoning about Change, MIT Press, Cambridge, MA, 1987.
42. R. Srinivasan, A.E. Howe, Comparison of methods for improving search efficiency in a partial-order planner, in: Proc. IJCAI-95, Montreal, Quebec, 1995, pp. 1620-1626.
43. D. Stalker, Grue! The New Riddle of Induction, Open Court, 1994.
44. D. Warren, Generating conditional plans and programs, in: Proc. Summer Conference on Artificial Intelligence and the Simulation of Behavior, 1976, pp. 344-354.
45. D. Weld, An introduction to least commitment planning, AI Magazine 15 (1994) 27-62.
46. M. Williamson, S. Hanks, Flaw selection strategies for value-directed planning, in: Proc. 3rd International Conference on Artificial Intelligence Planning Systems, 1996, pp. 237-244.