Abstract
In recent years a number of programming languages based upon the direct execution of temporal logic formulae have been developed. The use of such logics provides a powerful basis for the representation and implementation of a range of dynamic behaviours. Though many of these languages are still experimental, they are beginning to be applied, not only in computer science and AI, but also in less obvious areas such as user interfaces, process control and social modelling. This article provides an introduction to some of the basic concepts of executable temporal logics, together with an overview of the main approaches being pursued.
| Original language | English |
|---|---|
| Pages (from-to) | 43-56 |
| Number of pages | 14 |
| Journal | Knowledge Engineering Review |
| Volume | 11 |
| Issue number | 1 |
| Publication status | Published - Mar 1996 |
Keywords
- Artificial intelligence
- Computer programming languages
- Computer science
- Constraint theory
- Mathematical models
- Theorem proving
- User interfaces