Abstract
Predicate Logic is a natural support to computing systems: computation and deduction are closely related. The way to describe proof strategies can clarify the theoretical soundness of programming. This description involves the clarification of the role of control statements. A semantic analysis of program statements can suggest useful restrictions to the interpreter. These find a natural representation in a temporal framework.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Kowalski, Predicate Logic as a Programming Language IFIP 74, Stockolm, 1974
P. Hayes, Computation and Deduction Proc. of MFCS Symposium, Czech. Academy of Sciences, 1973
P. Hayes, Some problems and non problems in Representation Theory Proc. of AISB Summer Conference, Brighton, 1974
G. Sussman & T. Winograd, Microplanner reference manual Project MAC, AI Memo no 203, M.I.T., Cambridge, Mass, 1970
P. Roussel, PROLOG, Manuel de reference et d'utilization, U.E.R. de Marseille, Groupe d'Intelligence Artificielle, Luminy, 1975
M. Colombetti & E. Pagello, A Logical Framework for Robot Programming; Proc. of the 2o CISM-IFToMM International Symposium on Theory and Practice of Robots and Manipulators, Warsaw, 1976
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colombetti, M., Pagello, E. (1976). Programs, computations and temporal features. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_180
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_180
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive