Abstract
Logic perpetual processes (logic programs with infinite data structures) have been given several formal (operational and fixpoint) semantics. In this paper, we compare the various semantics and define a formal characterization of a least fixpoint semantics, which is based on a modified version of the logic programs and which is satisfactory for a large class of logical perpetual processes. Our results show that all the proposed fixpoint semantics are not equivalent to the operational semantics and suggest an improvement of the least fixpoint approach.
| Original language | English |
|---|---|
| Pages (from-to) | 691-711 |
| Number of pages | 21 |
| Journal | Acta Informatica |
| Volume | 25 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 1 Aug 1988 |
| Externally published | Yes |