Programs, computations and temporal features

  • Marco Colombetti
  • Enrico Pagello
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


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.

Key words

Predicate-Logic-like Programming Language Control Structures Temporal Features Restrictions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Kowalski, Predicate Logic as a Programming Language IFIP 74, Stockolm, 1974Google Scholar
  2. [2]
    P. Hayes, Computation and Deduction Proc. of MFCS Symposium, Czech. Academy of Sciences, 1973Google Scholar
  3. [3]
    P. Hayes, Some problems and non problems in Representation Theory Proc. of AISB Summer Conference, Brighton, 1974Google Scholar
  4. [4]
    G. Sussman & T. Winograd, Microplanner reference manual Project MAC, AI Memo no 203, M.I.T., Cambridge, Mass, 1970Google Scholar
  5. [5]
    P. Roussel, PROLOG, Manuel de reference et d'utilization, U.E.R. de Marseille, Groupe d'Intelligence Artificielle, Luminy, 1975Google Scholar
  6. [6]
    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, 1976Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Marco Colombetti
    • 1
  • Enrico Pagello
    • 2
  1. 1.MP-AI PROJECTPolitecnico di MilanoItaly
  2. 2.LADSEB-CNR, Area della RicercaPadovaItaly

Personalised recommendations