A hoare-style proof system for robot programs

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 74-79

  Liu, Yongmei ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGOL (PROGRAMMING LANGUAGE); ROBOT PROGRAMMING; SEMANTICS; THEOREM PROVING;

ROBOTIC CONTROLLERS;

LOGIC PROGRAMMING;

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

References (8)

1. Apt, K. 1981. Ten years of Hoare's logic: a survey-Part I. ACM Trans. Program. Lang. Syst. 3(4):431-483.
2. Apt, K. 1984. Ten years of Hoare's logic: a survey-Part II: nondeterminism. Theoret. Comput. Sci. 28:83-109.
3. Cook, S., and Liu, Y. 2002. A complete axiomatization for blocks world. In Seventh International Symposium on Artificial Intelligence and Mathematics.
4. Cook, S. 1978. Soundness and completeness of an axiom system for program verification. SIAM J. of Computing 7(1):70-90.
5. Hoare, C. 1969. An axiomatic basis for computer programming. Comm. ACM 12(10):576-580, 583.
6. Levesque, H.; Reiter, R.; Lespérance, Y.; Lin, F.; and Scherl, R. 1997. Golog: A logic programming language for dynamic domains. J. of Logic Programming 31:59-84.
7. McCarthy, J., and Hayes, P. 1969. Some philosophical problems from the standpoint of artificial intelligence. In Meltzer, B., and Michie, D., eds., Machine Intelligence 4, Edinburgh University Press. 463-502.
8. Reiter, R. 2001. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press.