12th International Symposium on Temporal Representation and Reasoning (TIME'05)

23-25 June 2005

Filter Results

Displaying Results 1 - 25 of 40
  • Proceedings. 12th International Symposium on Temporal Representation and Reasoning

    Publication Year: 2005
    Request permission for reuse | PDF file iconPDF (16 KB)
    Freely Available from IEEE
  • 12th International Symposium on Temporal Representation and Reasoning - Title Page

    Publication Year: 2005, Page(s):i - iii
    Request permission for reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • 12th International Symposium on Temporal Representation and Reasoning - Copyright Page

    Publication Year: 2005, Page(s): iv
    Request permission for reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • 12th International Symposium on Temporal Representation and Reasoning - Table of contents

    Publication Year: 2005, Page(s):v - vii
    Request permission for reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • Message from the Chairs

    Publication Year: 2005, Page(s): viii
    Request permission for reuse | PDF file iconPDF (33 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2005, Page(s):ix - x
    Request permission for reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • External referees

    Publication Year: 2005, Page(s): xi
    Request permission for reuse | PDF file iconPDF (20 KB)
    Freely Available from IEEE
  • Generalized model checking

    Publication Year: 2005
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (39 KB)

    Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions generated by automatic techniques such as predicate abstraction. Indeed, for the same cost, model checking three-valued abstractions (also called may/must abstractions) can be used to both prove and disprove any temporal-l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexing inventory snapshots

    Publication Year: 2005
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (38 KB) | HTML iconHTML

    Summary form only given. Inventory snapshots tell us what was on the shelves of a store at a given moment in time. In this article, an indexing structure that could efficiently capture the inventory at any past time was outlined, the time splitting data structure. It keeps both storage costs and snapshot query costs low. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time and the semantic Web

    Publication Year: 2005, Page(s):5 - 8
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (74 KB) | HTML iconHTML

    In this paper we discuss the role that temporal information plays in natural language text, specifically in the context of enriching the semantics of Web texts and Web interactions. We present a language, TimeML, which attempts to capture the richness of temporal and event related information in language, while demonstrating how it can play an important part in the development of more robust seman... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using inference for evaluating models of temporal discourse

    Publication Year: 2005, Page(s):11 - 19
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (145 KB) | HTML iconHTML

    This paper addresses the problem of building and evaluating models of the temporal interpretation of a discourse in natural language. The extraction of temporal information is a complicated task as it is not limited to finding pieces of information at specific places in a text. A lot of temporal data is made of relations between events, or relations between events and dates. Building such informat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for minimizing time granularity periodical representations

    Publication Year: 2005, Page(s):20 - 25
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (151 KB) | HTML iconHTML

    This paper addresses the technical problem of efficiently reducing the periodic representation of a time granularity to its minimal form. The minimization algorithm presented in the paper has an immediate practical application: it allows users to intuitively define granularities (and more generally, recurring events) with algebraic expressions that are then internally translated to mathematical ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint-based qualitative simulation

    Publication Year: 2005, Page(s):26 - 34
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (161 KB) | HTML iconHTML

    We consider qualitative simulation involving a finite set of qualitative relations in presence of complete knowledge about their interrelationship. We show how it can be naturally captured by means of constraints expressed in temporal logic and constraint satisfaction problems. The constraints relate at each stage the past of a simulation with its future. The benefit of this approach is that it re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A local method for prioritized fusion of temporal information

    Publication Year: 2005, Page(s):35 - 43
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (177 KB) | HTML iconHTML

    Information often comes from different sources and merging these sources usually leads to the apparition of inconsistencies. Fusion is the operation consists in restoring the consistency of the merged information by changing a minimum of the initial information. In this paper, we are interested in linear constraints prioritized fusion in the framework of simple temporal problems (STPs). Priority e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal XML? SQL strikes back!

    Publication Year: 2005, Page(s):47 - 55
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (747 KB) | HTML iconHTML

    While the introduction of temporal extensions into database standards has proven difficult to achieve, the newly introduced SQL:2003 and XML/XQuery standards have actually enhanced our ability to support temporal applications in commercial database systems. We illustrate this point by discussing three approaches that use temporally grouped representations. We first compare the approaches at the lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "TellMe": a novel protocol and location prediction scheme exploiting the "one for all" framework for location management

    Publication Year: 2005, Page(s):56 - 64
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (154 KB) | HTML iconHTML

    Motivated by the surge of location prediction challenges and inspired by the mutual advancements in knowledge discovery and location management, this paper opts for exploiting the merits of the one for all (OFA) framework for moving object databases (MOD) to address the crucial challenge of extrapolating object positions and balance the mainstay bandwidth-precision tradeoff. The proposed TellMe pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multilevel distance-based index structure for multivariate time series

    Publication Year: 2005, Page(s):65 - 73
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    Multivariate time series (MTS) datasets are common in various multimedia, medical and financial applications. In previous work, we introduced a similarity measure for MTS datasets, termed Eros (extended Frobenius norm), which is based on the Frobenius norm and principal component analysis (PCA). Eros computes the similarity between two MTS items by measuring how close the corresponding principal c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal query languages expressive power: /spl mu/TL vs. T-WHILE

    Publication Year: 2005, Page(s):74 - 82
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    We investigate the expressive power of implicit temporal query languages. The initial motivation was refining the results of (S. Abiteboul et al., 1999) and enrich them with comparison to /spl mu/TL (M.Y. Vardi, 1988). Thus, we address two classes of temporal query languages: /spl mu/TL-like languages based on TL and T-WHILE-like languages based on WHILE. We provide a two-level hierarchy (w.r t. e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CME: a temporal relational model for efficient coalescing

    Publication Year: 2005, Page(s):83 - 90
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (105 KB) | HTML iconHTML

    Coalescing is a data restructuring operation applicable to temporal databases. It merges timestamps of adjacent or overlapping tuples that have identical attribute values. The likelihood that a temporal query employs coalescing is very high. However, coalescing is an expensive and time consuming operation. In this paper, we present a novel temporal relational model through which coalescing becomes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A uniform algebraic characterization of temporal functional dependencies

    Publication Year: 2005, Page(s):91 - 99
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    In the database literature, different types of temporal functional dependencies (TFDs) have been proposed to constrain the temporal evolution of information. Unfortunately, the lack of a common notation makes it difficult to compare, to integrate, and to possibly extend the various proposals. In this paper, we outline a unifying algebraic framework for TFDs. We first introduce the proposed approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A trace semantics for positive core XPath

    Publication Year: 2005, Page(s):103 - 112
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (191 KB) | HTML iconHTML

    We provide a novel trace semantics for positive core XPath that exposes all intermediate nodes visited by the query engine. This enables a detailed analysis of all information relevant to the query. We give two examples of such analyses in the form of access control policies. We translate positive core XPath into linear temporal logic, showing that branching structures can be linearised effectivel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the freeze quantifier in constraint LTL: decidability and complexity

    Publication Year: 2005, Page(s):113 - 121
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (171 KB) | HTML iconHTML

    Constraint LTL, a generalization of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some real-time logics, but this variable-binding mechanism is quite general and ubiquitous in many logical languages (first-order temporal logics, hybrid logics, logics for se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Axiomatisation and decidability of multi-dimensional duration calculus

    Publication Year: 2005, Page(s):122 - 130
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (273 KB) | HTML iconHTML

    We investigate properties of a spatio-temporal logic based on an n-dimensional duration calculus tailored for the specification and verification of mobile real-time systems. After showing non-axiomatisability, we give a complete embedding in n-dimensional interval temporal logic and present two different decidable subsets, which are important for tool support and practical use. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Configuration logic: a multi-site modal logic

    Publication Year: 2005, Page(s):131 - 137
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (185 KB) | HTML iconHTML

    We introduce a logical formalism for describing properties of configurations of computing systems. This logic of trees allows quantification on node labels, which are modalities containing variables. We explain the motivation behind our formalism and give both a classical semantics and a new equivalent one based on partial functions on variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative temporal logics: PSpace and below

    Publication Year: 2005, Page(s):138 - 146
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (195 KB) | HTML iconHTML

    Often, the addition of metric operators to qualitative temporal logics leads to an increase of the complexity of satisfiability by at least one exponential. In this paper, we exhibit a number of metric extensions of qualitative temporal logics of the real line that do not lead to an increase in computational complexity. We show that the language obtained by extending since/until logic of the real ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.