Precondition Control and the Progression Algorithm

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 634-643

  Gabaldon, Alfredo ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION THEORY; CONDITION; FORWARD-CHAINING PLANNING; LINEAR TEMPORAL LOGIC; MARKOVIAN; NON-MARKOVIAN; PROGRESSION ALGORITHMS; SEARCH CONTROL; SITUATION CALCULUS; TEMPORAL LOGIC FORMULA;

ARTIFICIAL INTELLIGENCE;

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

References (19)

1. Bacchus, F., and Ady, M. 1999. Precondition control. Available at http://cs.toronto.edu/∼fbacchus/on-line.html.
2. Bacchus, F., and Kabanza, F. 1998. Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence 22:5-27.
3. Bacchus, F., and Kabanza, F. 2000. Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116:123-191.
4. Erol, K.; Hendler, J. A.; and Nau, D. S. 1996. Complexity results for hierarchical task-network planning. Annals of Mathematics and Artificial Intelligence 18:69-93.
5. Gabaldon, A. 2002. Non-markovian control in the situation calculus. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI'02), 519-524.
6. Gabaldon, A. 2003. Compiling control knowledge into preconditions for planning in the situation calculus. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI'03).
7. Green, C. 1969. Theorem proving by resolution as a basis for question-answering systems. In Meltzer, B., and Michie, D., eds., Machine Intelligence 4. New York: American Elsevier. 183-205.
8. Kautz, H., and Selman, B. 1998. The role of domain-specific knowledge in the planning as satisfiability framework. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS'98), 181-189.
9. Kvarnström, J., and Doherty, P. 2000. TALplanner: A temporal logic based forward chaining planner. Annals of Mathematics and Artificial Intelligence 30:119-169.
10. Kvarnström, J. 2002. Applying domain analysis techniques for domain-dependent control in TALPlanner. In Procs. of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS'02), 369-378.
11. Lin, F. 1997. An ordering of subgoals for planning. Annals of Mathematics and Artificial Intelligence. (Special issue in honor of Professor Michael Gelfond) 31(1-3):59-83.
12. Lin, F. 1998. Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator. Artificial Intelligence 103(1-2):273-294.
13. McCarthy, J. 1963. Situations, actions and causal laws. Technical report, Stanford University. Reprinted in Semantic Information Processing (M. Minsky ed.), MIT Press, Cambridge, Mass., 1968, pp. 410-417.
14. Pirri, F., and Reiter, R. 1999. Some contributions to the metatheory of the Situation Calculus. Journal of the ACM 46(3):325-364.
15. Reiter, R. 1991. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In Lifschitz, V., ed., Artificial Intelligence and Mathematical Theory of Computation. Academic Press. 359-380.
16. Reiter, R. 2001. Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. Cambridge, MA: MIT Press.
17. Rintanen, J. 2000. Incorporation of temporal logic control into plan operators. In Horn, W., ed., Procs. of the 14th European Conference on Artificial Intelligence (ECAI'00), 526-530. Amsterdam: IOS Press.
18. Sacerdoti, E. 1974. Planning in a hierarchy of abstraction spaces. Artificial Intelligence 5:115-135.
19. Wilkins, D. E. 1988. Practical Planning: Extending the classic AI planning paradigm. San Mateo, CA: Morgan Kaufmann.