View in EDS PDF Full Text

Order Independent Temporal Properties.

Saved in:
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 44441354
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Order Independent Temporal Properties.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Bidoit%2C+Nicole%22">Bidoit, Nicole</searchLink><relatesTo>1</relatesTo><i> bidoit@lri.fr</i><br /><searchLink fieldCode="AR" term="%22De+Amo%2C+Sandra%22">De Amo, Sandra</searchLink><relatesTo>2</relatesTo><i> deamo@ufu.br</i><br /><searchLink fieldCode="AR" term="%22Segoufin%2C+Luc%22">Segoufin, Luc</searchLink><relatesTo>3</relatesTo><i> Luc.Segoufin@inria.fr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Apr2004, Vol. 14 Issue 2, p277-298. 22p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+game+programming%22">Computer game programming</searchLink><br /><searchLink fieldCode="DE" term="%22First-order+logic%22">First-order logic</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science%22">Computer science</searchLink><br /><searchLink fieldCode="DE" term="%22Proof+theory%22">Proof theory</searchLink><br /><searchLink fieldCode="DE" term="%22Query+languages+%28Computer+science%29%22">Query languages (Computer science)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=44441354
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/logcom/14.2.277
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 22
        StartPage: 277
    Subjects:
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Computer game programming
        Type: general
      – SubjectFull: First-order logic
        Type: general
      – SubjectFull: Computer science
        Type: general
      – SubjectFull: Proof theory
        Type: general
      – SubjectFull: Query languages (Computer science)
        Type: general
    Titles:
      – TitleFull: Order Independent Temporal Properties.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Bidoit, Nicole
      – PersonEntity:
          Name:
            NameFull: De Amo, Sandra
      – PersonEntity:
          Name:
            NameFull: Segoufin, Luc
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2004
              Type: published
              Y: 2004
          Identifiers:
            – Type: issn-print
              Value: 0955792X
          Numbering:
            – Type: volume
              Value: 14
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Journal of Logic & Computation
              Type: main
ResultId 1