2009 16th International Symposium on Temporal Representation and Reasoning

23-25 July 2009

Filter Results

Displaying Results 1 - 25 of 29
  • [Front cover]

    Publication Year: 2009, Page(s): C1
    Request permission for reuse | PDF file iconPDF (2155 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for reuse | PDF file iconPDF (79 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009, Page(s): iii
    Request permission for reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for reuse | PDF file iconPDF (134 KB)
    Freely Available from IEEE
  • Table of contents

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

    Publication Year: 2009, Page(s): vii
    Request permission for reuse | PDF file iconPDF (125 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committee Lists

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

    Publication Year: 2009, Page(s): x
    Request permission for reuse | PDF file iconPDF (91 KB)
    Freely Available from IEEE
  • Dense Time Reasoning via Mosaics

    Publication Year: 2009, Page(s):3 - 10
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (215 KB) | HTML iconHTML

    In this paper we consider the problem of temporal reasoning over a real numbers model of time. After a quick survey of related logics such as those based on intervals, or metric information or rational numbers, we concentrate on using the Until and Since temporal connectives introduced in. We will call this logic RTL. Although RTL has been axiomatized and is known to be decidable it has only recen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The AXML Artifact Model

    Publication Year: 2009, Page(s):11 - 17
    Cited by:  Papers (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    Towards a data-centric workflow approach, we introduce an artifact model to capture data and workflow management activities in distributed settings. The model is built on Active XML, i.e., XML trees including Web service calls. We argue that the model captures the essential features of business artifacts as described informally in [A. Nigam and N. Caswell (2003)] or discussed in [R. Hull (2008)]. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking CTL is Almost Always Inherently Sequential

    Publication Year: 2009, Page(s):21 - 28
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004).For all these fragments, except for the trivial case without any temporal operator, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL

    Publication Year: 2009, Page(s):29 - 36
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    We present TCTLK, a continuous-time variant of the computational tree logic with knowledge operators, generalizing both TCTL, the continuous-time variant of CTL, and CTLK, the epistemic generalization of CTL. Formulas are interpreted over timed automata, with a synchronous and perfect recall semantics, and the observability relation requires one to specify what clocks are visible for an agent. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Expressivity of RoCTL*

    Publication Year: 2009, Page(s):37 - 44
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (326 KB) | HTML iconHTML

    RoCTL* was proposed to model robustness in concurrent systems. RoCTL* extended CTL* with the addition of obligatory and robustly operators, which quantify over failure-free paths and paths with one more failure respectively. Whether RoCTL* is more expressive than CTL* has remained an open problem since the RoCTL* logic was proposed. We use the equivalence of LTL to counter-free automata to show th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Event-Oriented Data Models and Temporal Queries in Transaction-Time Databases

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

    Past research on temporal databases has primarily focused on state-based representations and on relational query language extension for such representations. This led to many different proposals that had did not succeed in making a significant impact on SQL-compliant DBMS. More recently however, there has been significant interest and progress on event sequences, leading to vendor-proposed extensi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On First-Order Query Rewriting for Incomplete Database Histories

    Publication Year: 2009, Page(s):54 - 61
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    Multiwords are defined as words in which single symbols can be replaced by nonempty sets of symbols. Such a set of symbols captures uncertainty about the exact symbol. Words are obtained from multiwords by selecting a single symbol from every set. A pattern is certain in a multiword W if it occurs in every word that can be obtained from W. For a given pattern, we are interested in finding a logic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preserving Anonymity of Recurrent Location-Based Queries

    Publication Year: 2009, Page(s):62 - 69
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1163 KB) | HTML iconHTML

    The anonymization of location based queries through the generalization of spatio-temporal information has been proposed as a privacy preserving technique. We show that the presence of multiple concurrent requests, the repetition of similar requests by the same issuers, and the distribution of different service parameters in the requests can significantly affect the level of privacy obtained by cur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolution-Based Model Construction for PLTL

    Publication Year: 2009, Page(s):73 - 80
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    With tableaux-based reasoning approaches or model checking techniques for propositional linear-time temporal logics, PLTL, it is easily possible to construct counter examples for formulae that are not valid. In contrast, only the information that a formula is satisfiable is usually available in resolution-based inference systems. In this paper we present a resolution-based approach for constructin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time

    Publication Year: 2009, Page(s):81 - 87
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (363 KB) | HTML iconHTML

    This paper presents various semantic interpretations for logics of knowledge and time with prefect recall. We allow both past and future operators and examine the interpretation of different linear flows of time. In particular, we present temporal epistemic logics for each of the following flows of time: arbitrary linear orders; the integers; the rationals; the reals; and for uniform flows of time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Undecidability of Interval Temporal Logics with the Overlap Modality

    Publication Year: 2009, Page(s):88 - 95
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    We investigate fragments of Halpern-Shoham's interval logic HS involving the modal operators for the relations of left or right overlap of intervals. We prove that most of these fragments are undecidable, by employing a non-trivial reduction from the octant tiling problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple Algorithm for Simple Timed Games

    Publication Year: 2009, Page(s):99 - 106
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (302 KB) | HTML iconHTML

    We propose a subclass of timed game automata (TGA), called task TGA, representing networks of communicating tasks where the system can choose when to start the task and the environment can choose the duration of the task. We search to solve finite-horizon reachability games on task TGA by building strategies in the form of simple temporal networks with uncertainty (STNU). Such strategies have the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building Logical Specifications of Temporal Granularities through Algebraic Operators

    Publication Year: 2009, Page(s):107 - 114
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    Logical and algebraic approaches have been proposed in the literature for the definition and the management of time granularities. In the algebraic framework, a bottom granularity is assumed, and new granularities are created by means of suitable algebraic operators. In the logical framework, mathematical structures are used to represent time granularities, and logical formulae are used to specify... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong Temporal, Weak Spatial Logic for Rule Based Filters

    Publication Year: 2009, Page(s):115 - 121
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (179 KB) | HTML iconHTML

    Rule-based filters are sequences of rules formed of a condition and a decision. Rules are applied sequentially up to the first fulfilled condition, whose matching decision determines the outcome. Such filters are particularly useful in network management, where they filter packets allowed to flow in or out of an interface. Properties of filters which either reveal or hint to misconfiguration (anom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal Relations with Signals: The Case of Italian Temporal Prepositions

    Publication Year: 2009, Page(s):125 - 132
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (204 KB) | HTML iconHTML

    This paper presents a maximum entropy tagger for the identification of intra-sentential temporal relations between temporal expressions and eventualities mediated by temporal signals in constructions of the kind "eventuality + signal + temporal relation". The tagger reports an accuracy rate of 90.8%, outperforming the baseline (81.8%). One of the main results of this work is represented by the ide... View full abstract»

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

    Publication Year: 2009, Page(s):133 - 138
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    Timed contact algebras constitute an approach to a temporal version of a region based theory of space. The general theory does not provide a notion of an underlying static world, i.e. it does not explicitly contain a set of non moving regions. Furthermore, the model of time does not have any structure, i.e. time is neither ordered nor required to be discrete or continuous. In this paper we want to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interval Algebra Networks with Infinite Intervals

    Publication Year: 2009, Page(s):141 - 146
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infinite. We then show how algorithms developed for solving interval algebra networks with finite intervals can be used, with minor modifications, in the infinite case. View full abstract»

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