Heuristic planning: A declarative approach based on strategies for action selection

Artificial Intelligence

Volumn 153, Issue 1-2, 2004, Pages 307-337

  Sierra Santibáñez, Josefina ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Action selection strategies; Answer set planning; Declarative formalizations; Heuristic planning

Indexed keywords

FORMAL LOGIC; HEURISTIC METHODS; KNOWLEDGE REPRESENTATION; PROBLEM SOLVING;

ACTION SELECTION STRATEGIES; ANSWER SET PLANNING; DECLARATIVE FORMALIZATIONS; HEURISTIC PLANNING;

STRATEGIC PLANNING;

EID: 1642443397     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2002.11.001     Document Type: Conference Paper

References (45)

1. Artificial Intelligence Planning Systems: 1998 Planning Competition, 1998. http://ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html.
2. Artificial Intelligence Planning Systems: 2000 Planning Competition, 2000. http://www.cs.toronto.edu/aips2000.
3. Bacchus F., Kabanza F. Planning for temporally extended goals. Proceedings of AAAI-96, Portland, OR. 1996;1215-1222.
4. Bacchus F., Kabanza F. Using temporal logic to control search in a forward chaining planner. Ghallab M., Milani A. New Directions in AI Planning. 1996;141-153 IOS Press, Amsterdam.
5. Bacchus F., Kabanza F. Using temporal logics to express search control knowledge for planning. Artificial Intelligence. 116:2000;123-191.
6. Bonet B., Geffner H. Planning as heuristic search. Artificial Intelligence. 129:(1-2):2001;5-33.
7. Clark K. Negation as failure. Gallaire H., Minker J. Logic and Data Bases. 1978;293-322 Plenum Press, New York.
8. Dimopoulos Y., Nebel B., Koehler J. Encoding planning problems in nonmonotonic logic programs. Proceedings of the Fourth European Conference on Planning. 1978;169-181.
9. Doherty P., Kvarnstrom J. TALplanner: A temporal logic-based planner. AI Magazine. 22:(3):2001;95-102.
10. Erdem E. Applications of logic programming to planning: computational experiments. Technical Report, Computer Science, University of Texas at Austin, 2000 http://www.cs.utexas.edu/users/esra/papers.html.
11. Fikes R., Nilsson N. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence. 2:(3-4):1971;189-208.
12. Finzi A., Pirri F., Reiter R. Open world planning in the situation calculus. Proceedings of AAAI-00, Austin, TX. 2000;754-760.
13. Gelfond M., Lifschitz V. The stable model semantics for logic programming. Proceedings of the Fifth International Conference on Logic Programming. 1988;1070-1080.
14. Gelfond M., Lifschitz V. Logic programs with classical negation. Proceedings of the Seventh International Conference on Logic Programming. 1990;579-597.
15. M. Genesereth, J. Hsu, Partial programs, TR 89-20, Computer Science Department, Stanford University, 1989.
16. Kautz H., Selman B. Blackbox: A new approach to the application of theorem proving to problem solving. Technical Report, 1998. System available at http://www.research.att.com/kautz.
17. Koehler J., Nebel B., Hoffmann J., Dimopoulos Y. Extending planning graphs to an ADL subset. Proceedings of the European Conference on Planning. 1997;273-285.
18. Kvarnstrom J., Doherty P. TAL planner: A temporal logic based forward chaining planner. Ann. Math. Artificial Intelligence. 30:(1):2000;119-169.
19. Levesque H., Reiter R., Lesperance Y., Lin F., Scherl R. GOLOG: A logic programming language for dynamic domains. J. Logic Programming. 31:1997;59-84.
20. Lifschitz V. Answer set planning. Proceedings of the International Conference on Logic Programming. 1999;23-37.
21. Lifschitz V. Answer set programming and plan generation. Artificial Intelligence. 138:2002;39-54.
22. Lin F. Applications of the situation calculus to formalizing control and strategic information: The prolog cut operator. Proceedings of IJCAI-97, Nagoya, Japan. 1997;1412-1418.
23. Lin F. On measuring plan quality (a preliminary report). Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, Trento, Italy. 1998;224-232.
24. Lin F. Search algorithms in the situation calculus. Levesque H., Pirri P. Logical Foundations of Cognitive Agents: Contributions in Honor of Ray Reiter. 1999;213-233 Springer, Berlin.
25. Lin F. A planner called R. AI Magazine. 22:(3):2001;73-76.
26. Marek V., Truszcynski M. Stable models and an alternative logic programming paradigm. Apt K., Marek V., Truszczynski M., Warren D. The Logic Programming Paradigm: A 25-Year Perspective. 1999;375-398 Springer, Berlin.
27. McCarthy J. Programs with common sense. Mechanization of Thought Processes, Proceedings of the Symposium of the National Physics Laboratory. 1959;77-84. reproduced in [28].
28. McCarthy J. Formalizing Common Sense. 1990;Ablex, Norwood, NJ.
29. McCarthy J. Lecture notes of CS323: Course on the formalization of common sense and nonmonotonic reasoning. Technical Report, 1997, available at http://www-formal.stanford.edu/jmc/cs323/96/lecture-notes.ps.
30. McCarthy J. Notes on human level intelligence, section on heuristics. Technical Report, 1997, available at http://www-formal.stanford.edu/jmc/human/node10.html.
31. McCarthy J. Concepts of logical AI. Minker J. Logic-Based Artificial Intelligence. 2001;37-56 Kluwer Academic, Dordrecht.
32. McCarthy J., Hayes P. Some philosophical problems from the standpoint of artificial intelligence. Meltzer B., Michie D. Machine Intelligence. vol. 4:1969;463-502 Edinburgh University Press, Edinburgh.
33. Niemela I. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artificial Intelligence. 23:(3-4):1999;241-273.
34. Pednault E. ADL: Exploring the middle ground between STRIPS and the situation calculus. Proceedings of the International Conference on Principles of Knowledge Representation (KR-98), Trento, Italy. 1989;324-332.
35. Reiter R. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. Lifschitz V. Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. 1991;359-380 Academic Press, New York.
36. Reiter R. Proving properties of states in the situation calculus. Artificial Intelligence. 64:(2):1993;337-351.
37. Reiter R. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. 2001;MIT Press, Cambridge, MA.
38. Sierra J. Declarative formalization of strategies for action selection. Proceedings of the Seventh International Workshop on Non-monotonic Reasoning. 1998;21-29.
39. Sierra-Santibáñez J. Declarative formalization of reasoning strategies: A case study on heuristic nonlinear planning. Ann. Math. Artificial Intelligence. 39:2003;61-100.
40. Sierra J. Declarative formalization of strategies for action selection: Applications to planning. Proceedings of the Seventh European Workshop on Logics in Artificial Intelligence. Lecture Notes in Computer Science. 2000;21-35 Springer, Berlin.
41. P. Simons, Extending and implementing the stable model semantics, Doctoral Dissertation, Research Report 58, University of Technology, Helsinki, Finland, 2000.
42. SMODELS 2.26, 2001, available at http://www.tcs.hut.fi/Software/smodels/.
43. Subrahmanian V., Zaniolo C. Relating stable models and AI planning domains. Proceedings of the International Conference on Logic Programming. 1995;233-247.
44. T. Syrjanen, Implementation of local grounding for logic programs with stable model semantics, B 18, Digital Systems Laboratory, University of Technology, Helsinki, Finland, 1998.
45. Systems, 2001, Systems capable of computing answer sets are available at http://www.tcs.hut.fi/Software/smodels http://www.dbai.tuwien.ac.at/proj/dlv http://www.cs.engr.uky.edu/̃lpnmr/DeReS.html http://www.cs.utexas.edu/users/mmcain/cc.