A correctness result for reasoning about one-dimensional planning problems

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2010, Pages 362-371

  Hu, Yuxiao ^a   Levesque, Hector J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SEMANTICS;

CONTROL STRUCTURE; GENERAL SOLUTIONS; MULTIPLE PLANNING; NON-TRIVIAL; PLANNING PROBLEM; PRECISE DEFINITION; SITUATION CALCULUS; VERIFICATION ALGORITHMS;

KNOWLEDGE REPRESENTATION;

EID: 84860591727     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bonet, B.; Palacios, H.; and Geffner., H. 2009. Automatic derivation of memoryless policies and finite-state controllers using classical planners. In Proceedings of International Conference on Automated Planning and Scheduling.
2. Clarke, E. M.; Grumberg, O.; and Peled, D. A. 1999. Model Checking. MIT Press.
3. Gelfond, M., and Lifschitz, V. 1993. Representing actions and change by logic programs. Journal of Logic Programming 301-323.
4. Hu, Y., and Levesque, H. 2009. Planning with loops: Some new results. In ICAPS Workshop on Generalized Planning: Macros, Loops, Domain Control.
5. Levesque, H. 1996. What is planning in the presence of sensing. In Proceedings of National Conference on Artificial Intelligence.
6. Levesque, H. 2005. Planning with loops. In Proceedings of International Joint Conference on Artificial Intelligence.
7. Lin, F., and Levesque, H. 1998. What robots can do: robot programs and effective achievability. Artificial Intelligence.
8. Lin, F. 2008. Proving goal achievability. In Proceedings of International Conference on the Principles of Knowledge Representation and Reasoning.
9. Magnusson, M., and Doherty, P. 2008. Deductive planning with inductive loops. In Proceedings of National Conference on Artificial Intelligence.
10. Manna, Z., andWaldinger, R. 1987. How to clear a block: a theory of plans. Journal of Automated Reasoning 3(4):343- 377.
11. McCarthy, J., and Hayes, P. 1969. Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 463-502.
12. Pirri, F., and Reiter, R. 1999. Some contributions to the metatheory of the situation calculus. Journal of the ACM 46(3):261-325.
13. Reiter, R. 2001. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press.
14. Scherl, R., and Levesque, H. 2003. Knowledge, action, and the frame problem. Artificial Intelligence 144.
15. Srivastava, S.; Immerman, N.; and Zilberstein, S. 2008. Learning generalized plans using abstract counting. In Proceedings of National Conference on Artificial Intelligence.
16. Thielscher, M. 1998. Introduction to the fluent calculus. Electronic Transactions on Artificial Intelligence 2(3- 4):179-192.
17. Winner, E., and Veloso, M. 2007. LoopDISTILL: Learning domain-specific planners from example plans. In Proceedings of ICAPS-07 Workshop on AI Planning and Learning.