What robots can do: Robot programs and effective achievability

Artificial Intelligence

Volumn 101, Issue 1-2, 1998, Pages 201-226

  Lin, Fangzhen ^a   Levesque, Hector J ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Abilities; Achievability; Cognitive robotics; Effective achievability; Robot programs; Robotics; Situation calculus; Theories of actions

Indexed keywords

COGNITIVE SYSTEMS; COMPUTER PROGRAMMING LANGUAGES; RECURSIVE FUNCTIONS; ROBOT LEARNING; ROBOT PROGRAMMING;

ACHIEVABILITY; EQUIVALENCE THEOREM; TURING MACHINES;

ROBOTICS;

EID: 0032072878     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(98)00041-1     Document Type: Article

References (25)

1. E. Davis, Knowledge preconditions for plans, J. Logic Comput. 4 (5) (1994) 721-766.
2. O. Etzioni, S. Hanks, D. Weld, D. Draper, N. Lesh and M. Williamson, An approach to planning with incomplete information, in: Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference, Cambridge; MA, Morgan Kaufmann, San Mateo, CA, 1992, pp. 115-125.
3. R.E. Fikes and N.J. Nilsson, STRIPS: a new approach to theorem proving in problem solving, Artificial Intelligence 2 (1971) 189-208.
4. C. Green, Theorem proving by resolution as a basis for question-answering systems, in: B. Meltzer and D. Michie (Eds.), Machine Intelligence, Vol. 4, Edinburgh University Press, Edinburgh, 1969, pp. 183-205.
5. Y. Lespérance, H. Levesque and F. Lin, Ability and knowing how in the situation calculus, in preparation.
6. H. Levesque, R. Reiter, Y. Lespérance, F. Lin and R. Scherl, GOLOG: a logic programming language for dynamic domains, J. Logic Programming 31 (1-3) (1997) 59-83.
7. H. Levesque, What is planning in the presence of sensing?, in: Proceedings AAAI-96, Portland, OR, 1996, pp. 1139-1146.
8. F. Lin, Applications of the situation calculus to formalizing control and strategic information: the prolog cut operator, in: Proceedings Fifteen International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan, Morgan Kaufmann, San Mateo, CA, 1997, pp. 1412-1418.
9. F. Lin, An ordering on subgoals for planning, Ann. Math. Artificial Intelligence 21 (1997) 321-342.
10. F. Lin, On measuring plan quality, in: Proceedings Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998.
11. F. Lin and R. Reiter, State constraints revisited, in: J. Logic Comput. 4 (5) (1994) 655-678.
12. F. Lin and R. Reiter, How to progress a database, Artificial Intelligence 92 (1-2) (1997) 131-167.
13. K. Krebsbach, D. Olawsky and M. Gini, An empirical study of sensing and defaulting in planning, in: Proceedings 1st Conference on AI Planning Systems, San Mateo, CA, 1992, pp. 136-144.
14. Z. Manna and R. Waldinger, How to clear a block: a theory of plans, J. Automated Reasoning 3 (1987) 343-377.
15. J. McCarthy and P.J. Hayes, Some philosophical problems from the standpoint of artificial intelligence, in: B. Meltzer and D. Michie (Eds.), Machine Intelligence, Vol. 4, Edinburgh University Press, Edinburgh, 1969, pp. 463-502.
16. E. Mendelson, An Introduction to Mathematical Logic, Van Rostrand Reinhold Company, New York, 1964.
17. E.P. Pednault, ADL: exploring the middle ground between STRIPS and the situation calculus, in: Proceedings First International Conference on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, Ont., Morgan Kaufmann, San Mateo, CA, 1989, pp. 324-332.
18. 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 (KR'92), Cambridge, MA, Morgan Kaufmann, San Mateo, CA, 1992, pp. 103-114.
19. M. Peot and D. Smith, Conditional nonlinear planning, in: Proceedings 1st Conference on AI Planning Systems, San Mateo, CA, 1992, pp. 189-197.
20. R. Reiter, The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression, in: V. Lifschitz (Ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, Academic Press, San Diego, CA, 1991, pp. 359-380.
21. R. Reiter, Proving properties of states in the situation calculus, Artificial Intelligence 64 (1993) 337-351.
22. R. Scherl and H. Levesque, The frame problem and knowledge-producing actions, in: Proceedings AAAI-93, Washington, DC, AAAI Press/The MIT Press, CA, 1993, pp. 689-695.
23. M. Schoppers, Building plans to monitor and exploit open-loop and closed-loop dynamics, in: Proceedings 1st Conference on AI Planning Systems, San Mateo, CA, 1992, pp. 204-213.
24. S. Thomas, PLACA, an agent oriented programming language, Ph.D. Thesis, Department of Computer Science, Stanford University, 1993.
25. W. van der Hoek, B. van Linder and J.-J.Ch. Meyer, A logic of capabilities, in: A. Nerode and Y. Matiyasevitch (Eds.), Proceedings LFCS-94, the 3rd International Symposium on the Logical Foundations of Computer Science, Springer, Berlin, 1994, pp. 366-378.