2008 15th International Symposium on Temporal Representation and Reasoning

16-18 June 2008

Filter Results

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

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

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

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

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

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

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

    Publication Year: 2008, Page(s): viii
    Request permission for reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • Program Committee

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

    Publication Year: 2008, Page(s): x
    Request permission for reuse | PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • Temporal Description Logics: A Survey

    Publication Year: 2008, Page(s):3 - 14
    Cited by:  Papers (51)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfiability problem and algorithms for deciding it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Oracle Extensibility Framework for Supporting Temporal and Spatio-Temporal Applications

    Publication Year: 2008, Page(s):15 - 18
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    Databases such as Oracle, IBM, SQLServer are increasing their support for temporal and spatio- temporal data with every release. In this paper, we describe how Oracle users can extend the existing functionality in Oracle and ground their research by using Oracle's extensibility. To illustrate its applicability to temporal data, we present how a Map21 (M.A. Nascimento and M.H. Dunham, 1999) based i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Time Model Checking: Algorithms and Complexity

    Publication Year: 2008, Page(s): 19
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (145 KB) | HTML iconHTML

    In this talk we describe a new automata-theoretic approach to model checking real-time systems. We show how this approach yields both upper and lower complexity bounds for various decision problems involving timed automata and temporal logics. To put these developments in context we survey some classical results concerning automata, temporal logic and monadic predicate logic over the reals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Complexity of  CaRet + Chop

    Publication Year: 2008, Page(s):23 - 31
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (347 KB) | HTML iconHTML

    .We investigate the complexity of satisfiability and pushdown model-checking of the extension of the logic CaRet with the binary regular modality 'Chop'. We present automata-theoretic decision procedures based on a direct and compositional construction, which for finite (resp., infinite) words require time of exponential height equal to the nesting depth of chop modality plus one (resp., plus two)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Good Friends are Hard to Find!

    Publication Year: 2008, Page(s):32 - 40
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (346 KB) | HTML iconHTML

    We focus on the problem of finding (the size of) a minimal winning coalition in a multi-player game. We prove that deciding whether there is a winning coalition of size at most k is HP-complete, while deciding whether k is the optimal size is DP -complete. We also study different variants of our original problem: the function problem, where the aim is to effectively compute the coalition; more suc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regarding Overlapping as a Basic Concept of Subset Spaces

    Publication Year: 2008, Page(s):41 - 45
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    An operator describing overlapping is substituted/or the effort modality of Moss and Parikh's logic of knowledge and topology. This means that the spatial idea underlying that system, viz closeness, is replaced with covering. We ask what properties of frames can be expressed by means of the new language. It turns out that the language is, for example, capable of characterizing directed spaces. Aft... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a Formal Framework for Spatio-Temporal Granularities

    Publication Year: 2008, Page(s):49 - 53
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    In the spatial context, the research community has not reached yet a widely accepted definition of granularity. There are relatively few papers about "spatial granularities " and many of them give different definitions and often refer to different interpretations of the term "spatial granularity". In this work we propose a formal definition of "spatial granularity" and other related terms involved... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing Public Transport Schedules as Repeating Trips

    Publication Year: 2008, Page(s):54 - 58
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    The movement in public transport networks is organized according to schedules. The real-world schedules are specified by a set of periodic rules and a number of irregularities from these rules. The irregularities appear as cancelled trips or additional trips on special occasions such as public holidays, strikes, cultural events, etc. Under such conditions, it is a challenging problem to capture re... View full abstract»

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

    Publication Year: 2008, Page(s):59 - 63
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (225 KB) | HTML iconHTML

    Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed contact structures. We study their canonical models using topological spaces. As the main contribution we prove a general representation theorem for this kind of algebras. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Heuristic Approach to Order Events in Narrative Texts

    Publication Year: 2008, Page(s):67 - 71
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (315 KB) | HTML iconHTML

    We describe a heuristic method to order the events evoked in texts describing road accidents. The method consists first in generating, by non monotonic inference rules, a set of precedence and simultaneity constraints between temporal references linked to particular words of the text. Then, the proposed algorithm updates the narration order of the events to satisfy these constraints and give the r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Satisfying a Fragment of XQuery by Branching-Time Reduction

    Publication Year: 2008, Page(s):72 - 76
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    Configuration logic (CL) is a fragment of XQuery that allows first-order quantification over node labels. In this paper, we study CL satisfiability and seek a deterministic decision procedure to build models of satisfiable CL formula. To this end, we show how to revert CL satisfiability into an equivalent CTL satisfiability problem in order to leverage existing model construction algorithms for CT... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Similarity Join of Large Sets of Moving Object Trajectories

    Publication Year: 2008, Page(s):79 - 87
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (337 KB) | HTML iconHTML

    We address the problem of performing efficient similarity join for large sets of moving objects trajectories. Unlike previous approaches which use a dedicated index in a transformed space, our premise is that in many applications of location-based services, the trajectories are already indexed in their native space, in order to facilitate the processing of common spatio-temporal queries, e.g., ran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Greedy Approach Towards Parsimonious Temporal Aggregation

    Publication Year: 2008, Page(s):88 - 92
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    Temporal aggregation is a crucial operator in temporal databases and has been studied in various flavors. In instant temporal aggregation (ITA) the aggregate value at time instant t is computed from the tuples that hold at t. ITA considers the distribution of the input data and works at the smallest time granularity, but the result size depends on the input timestamps and can get twice as large as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time Aware Mining of Itemsets

    Publication Year: 2008, Page(s):93 - 97
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    Frequent behavioural pattern mining is a very important topic of knowledge discovery, intended to extract correlations between items recorded in large databases or Web access logs. However, those databases are usually considered as a whole and hence, itemsets are extracted over the entire set of records. Our claim is that possible periods, hidden within the structure of the data and containing com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Labeled Tableaux System for the Distributed Temporal Logic DTL

    Publication Year: 2008, Page(s):101 - 109
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    DTL is a distributed temporal logic for reasoning about temporal properties of distributed systems from the local point of view of the system's agents, which are assumed to execute sequentially and to interact by means of synchronous event sharing. We present a sound and complete labeled tableaux system for future-time DTL. To achieve this, we first formalize a labeled tableaux system for reasonin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal tableau for Right Propositional Neighborhood Logic over Trees

    Publication Year: 2008, Page(s):110 - 117
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    Propositional interval temporal logics come into play in many areas of artificial intelligence and computer science. Unfortunately, most of them turned out to be (highly) undecidable. Some positive exceptions, belonging to the classes of neighborhood logics and of logics of subinterval relations, have been recently identified. In this paper, we address the decision problem for the future fragment ... View full abstract»

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