Bibliographic Details
| Title: |
Order Independent Temporal Properties. |
| Authors: |
Bidoit, Nicole1 bidoit@lri.fr, De Amo, Sandra2 deamo@ufu.br, Segoufin, Luc3 Luc.Segoufin@inria.fr |
| Source: |
Journal of Logic & Computation. Apr2004, Vol. 14 Issue 2, p277-298. 22p. |
| Subjects: |
Programming languages, Computer game programming, First-order logic, Computer science, Proof theory, Query languages (Computer science) |
| Abstract: |
The paper investigates temporal properties that are invariant with respect to the temporal ordering and that are expressible by temporal query languages either explicit like FO(≤) or implicit like TL. In the case of an explicit time representation, these ‘order invariant’ temporal properties are simply those expressible in the language FO(=). In the case of an implicit time representation, we introduce a new language, TL(Ei) that captures exactly these properties. The expressive power of the language TL(Ei) is characterized via a game à la Ehrenfeucht-Fraïssé. This provides another proof, using a more classical technique, that the implicit temporal language TL is strictly less expressive than the explicit temporal language FO(≤). This alternative proof is interesting by itself and opens new perspectives in the investigation of results of the same kind for more expressive implicit temporal languages than TL. [ABSTRACT FROM PUBLISHER] |
|
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
