No label defined (Q4733442)
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 4119670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4119670 |
Statements
1987
0 references
temporal logic programming
0 references
Tempura programming language
0 references
interval temporal logic
0 references
0.8797124028205872
0 references
[For the entire collection see Zbl 0683.68003.] The main goal of the paper is to argue that temporal logic (TL) could be a very suitable programming environment, even compared with Horn Clause Logic (thus Prolog), or with the Pascal-type (procedural) languages. Instead of a classical linear time TL, it is used the B. C. Moszkowski's interval temporal logic (ITL). Section 2 formally defines the \underbar{ITL framework} as a \underbar{modal logic operating on intervals}: the `necessity' operator has the meaning: ``on all subintervals'', the `possibility' operator means ``on at least one subinterval'', the `semicolon' operator denotes the sequential composition, and the `next' operator refers the next subinterval (the tail of the current interval). Thus ITL extends the classical predicate logic, containing all the known logical operators, connectives and quantifiers, with the \underbar{important observation} that in the temporal world their intuitive meaning could be different (e.g. the conjunction has the meaning of parallel composition, while the disjunction means nondeterministic execution). A specific subset of ITL is interpreted by B. C. Moszkowski as a programming language called \underbar{Tempura} (Section 3). Designed initially for multi-level reasoning about hardware (digital circuits), \underbar{Tempura} proved its abilities on much general contexts. An ITL formula is interpreted as a \underbar{Tempura} program, executed by successive transformations: it is reduced to a part which specifies the current state, and a part which is true on the next terminal subinterval. As the current state advances, this reduction is repeated until finally the current subinterval is just a single state and there is no next subinterval. When the reduction of the problem is complete, the program has the form \(w=\bigwedge^{n}_{i=0}\underline{next}^ i(w_ i)\), \underbar{next}\({}^ i(w_ i)\) representing the \b{i}-th application of the `next' operator to the formula w. But the reduction technique does not work for arbitrary formulae because not every formula can be reduced to a conjunction of the above form. (The use of \underbar{disjunction} would increase the complexity of the execution algorithm because of their variants would deserve to be at least mentioned in the context.) Syntactic and semantic properties of the \underbar{linear and branching time} models, including \underbar{computation tree logics} (and C. A. R. Hoare's communicating sequential processes), as \underbar{models of concurrency} are discussed. B. Moszkowski's (1983) TL semantics is based on intervals. A subset of \underbar{Interval TL} has been developed as a programming language: \underbar{Tempura} interpreters are written in Lisp and C. \underbar{Tokio} is another TL programming language, implemented in Japan as a Prolog interpreter, all devoted to program analysis. Some fundamental hints entailed from this survey flight of the TL domain: (a) TL is coming from, and mutually interfere (at a growing rate) with philosophy, AI, and computer science (software engineering, concurrent/parallel computing); (b) First-order and/or modal approaches dominate the TL models: while AI people tend to opt for the first one, the second one is nearly universal in program behaviour modelling; (c) The deduction automation of modal TLs would be of fundamental importance both for the temporal expression of natural languages (thus AI), as well as for computer science subfields.
0 references