No label defined (Q4733378)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4119594
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4119594

      Statements

      0 references
      1987
      0 references
      philosophy
      0 references
      artificial intelligence
      0 references
      computer science
      0 references
      temporal logic
      0 references
      Tempura
      0 references
      temporal logic programming language
      0 references
      [For the entire collection see Zbl 0683.68003.] This is a survey paper, featuring the growing mutual interest and close cooperation among philosophy, artificial intelligence (AI), and computer science, on the fruitful field of temporal logic (TL). In the first section, the philosophical background of TLs is investigated with two main approaches: the first-order versus the modal logic. B. Russel and W. Quine translate the idea of `changing' into the first-order logic language. In the fifties, A. N. Prior constructed the first tense logic, showing its relation to modal logic axiom systems S4 and S5. These two essential approaches to TL may be viewed as rivals but rather as allies science, on the base of the known Kripke (model theory) semantics of modal logics, and tense-logical formula can be rewritten into a first- order formula. The axiom system corresponding to this embedding is known as minimal tense logic, providing the basis for the most other TL systems that have been studied. There are discussed: J. A. W. Kamp's logic of temporal discourse, G. E. M. Anscombe's logic of aspect, G. H. von Wright's logic of action, A. Galton's event logic, H. Reichenbach's theory of tenses, etc. The second section deals with TL in AI and cognitive science. B. C. Bruce (1972) used a first-order theory of tense into the question-answering system `Chronos'. Drew McDermott's TL is based on two major assumptions: the time line is continuous, and any time point has many possible features. J. F. Allen's theory of time is based on temporal relationships, since he considers that ``the only times we can identify are times of occurrences and properties''. These TLs have as main goal to facilitate automated planning for problem-solving. Other recent approaches on TL are outlined. The third section discusses the TL approaches to computer science. R. W. Floyd's inductive assertion method, its C. A. R. Hoare's axiomatization, R. Burstall's intermittent assertion methods, A. Pnueli's TL of programs and numerous related approaches. (V. R. Pratt's dynamic and process logics, A. Salwicki's algorithmic logic, and the backtracking used to generate all the subintervals satisfying the alternate formula \(w_ 1\vee w_ 2)\). For a negated formula, one must assume the `closed world' hypothesis, similarly to the Prolog language. Section 4 applies Tempura programming to four different problems. The Tempura programs are analysed and compared with the corresponding Prolog and Pascal ones. The considered problems are: (1) the Towers of Hanoi, (2) the representation of a bouncing ball motion, (3) a model of data transmission using the RS-232 protocol, and (4) the design of hardware devices (including digital circuits). Tempura, as a temporal logic programming language, embodies ideas both from conventional imperative programming as well as from the dataflow style, supporting the idea of change in a logical frame specification of algorithmic constructs such as loops, hierarchical specification and distributive assignment, a strong parallelism instead of an arbitrary interleaving.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references