2015 22nd International Symposium on Temporal Representation and Reasoning (TIME)

23-25 Sept. 2015

Filter Results

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

    Publication Year: 2015, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (3030 KB)
    Freely Available from IEEE
  • [Title page i]

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

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

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

    Publication Year: 2015, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (141 KB)
    Freely Available from IEEE
  • Message from Programme Co-chairs

    Publication Year: 2015, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (106 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organization

    Publication Year: 2015, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (89 KB)
    Freely Available from IEEE
  • Programme Committee

    Publication Year: 2015, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (178 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2015, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • Historical Queries on Wikipedia: A Usability-Driven Approach

    Publication Year: 2015, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (82 KB) | HTML iconHTML

    The extraordinary success of Wikipedia shows that major advances in Web document searching and knowledge retrieval can be achieved once powerful structured queries on RDF knowledge bases will be supported by semantic-web information systems. Significant research progress on the usability front is being made by two main approaches. One is the Swipe approach, where casual users can pose powerful str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal Reasoning in Bounded Situation Calculus

    Publication Year: 2015, Page(s): 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB) | HTML iconHTML

    In this talk, we survey recent results on situation calculus bounded action theories. These are action theories with the constraints that the size of the extension of fluents in every situation must be bounded, though such an extension changes from situation to situation. Such action theories give rise to infinite transition systems that can be faithfully abstracted into finite ones, making verifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Formal Verification of Distributed Algorithms

    Publication Year: 2015, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (83 KB) | HTML iconHTML

    Model checking is an automatic verification technique, which provides an answer to the question whether a program, given as a state-transition system, satisfies its specification, given in terms of a temporal-logic formula. Model checking is very well studied as far as boolean finite-state programs are concerned [CGP99]. To take into account several sources of infinity such as an unknown number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks

    Publication Year: 2015, Page(s):4 - 18
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (525 KB) | HTML iconHTML

    A Conditional Simple Temporal Network (CSTN) is a data structure for representing and reasoning about time-points and temporal constraints, some of which may apply only in certain scenarios. The scenarios in a CSTN are represented by conjunctions of propositional literals whose truth values are not known in advance, but instead are observed in real time, during execution. The most important proper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking

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

    Conditional Simple Temporal Network (CSTN) is a constraint-based graph-formalism for conditional temporal planning. It offers a more flexible formalism than the equivalent CSTP model of Tsamardinos, Vidal and Pollack, from which it was derived mainly as a sound formalization. Three notions of consistency arise for CSTNs and CSTPs: weak, strong, and dynamic. Dynamic consistency is the most interest... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Feature Extraction for Time Series Analysis Using Least-Squares Approximations with Orthogonal Basis Functions

    Publication Year: 2015, Page(s):29 - 37
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    Many efforts have been made during the past decades to investigate the use of orthogonal basis functions in the field of least-squares approximation. Certain bases of orthogonal functions allow for a definition of fast update algorithms for approximations of time series in sliding or growing time windows. In fields such as technical data analytics, temporal data mining, or pattern recognition in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unifying Sequenced and Non-sequenced Semantics

    Publication Year: 2015, Page(s):38 - 46
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    Sequenced and nonsequenced semantics were introduced as different semantics for the evaluation of an operation in a temporal database such as a query or data modification. In this paper we present a new framework that shows both semantics are variants of a general temporal semantics. Our framework uses tuple lineage to track tuples through operations. We present the general semantics and show addi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Price of Evolution in Temporal Databases

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

    Temporal Functional Dependencies (TFDs for short) are functional dependencies that predicate on temporal databases characterized by a special temporal dimension called valid time (VT). In [1] Combi et al. proposed a uniform framework that subsumes many of the TFDs proposed in literature and, by the combination of them, allow us to express finer constraints. Some interesting constraints are the Tem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LTL Fragments are Hard for Standard Parameterisations

    Publication Year: 2015, Page(s):59 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    We classify the complexity of the LTL satisfiability and model checking problems for several standard parameterisations. The investigated parameters are temporal depth, number of propositional variables and formula treewidth, resp., pathwidth. We show that all operator fragments of LTL under the investigated parameterisations are intractable in the sense of parameterised complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalizing Allen's Theory of Time to Tree-Like Structures

    Publication Year: 2015, Page(s):69 - 78
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    Allen's Interval Algebra is one of the most prominent formalisms in the area of qualitative temporal (and, by extension, spatial) reasoning. However, its applications are naturally restricted to linear flows of time. While there is some recent work focused on studying relations between intervals (and also between intervals and points) on branching structures, there is no rigorous study of the firs... View full abstract»

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

    Publication Year: 2015, Page(s):79 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (298 KB) | HTML iconHTML

    The chop operator C is a binary modality that plays an important role in interval temporal logics. Such an operator, which is not definable in Halpern and Shoham's modal logic of time intervals HS, allows one to split an interval into two parts and to specify what is true over them. C appears both in Moszkowski's PITL (that pairs it with a modal constant Pi which is true on all and only the interv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of ITL Model Checking: Some Well-Behaved Fragments of the Interval Logic HS

    Publication Year: 2015, Page(s):90 - 100
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases. Most of the proposed solutions make use of classical, point-based temporal logics, while little work has been done in the interval temporal logic setting. Recently, a non-elementary model checking algorithm for Halpern and Shoham's modal logic o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Model Checking Fingerprints of CTL Operators

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

    The aim of this study is to understand the inherent expressive power of CTL operators. We investigate the complexity of model checking for all CTL fragments with one CTL operator and arbitrary Boolean operators. This gives us a fingerprint of each CTL operator. The comparison between the fingerprints yields a hierarchy of the operators that mirrors their strength with respect to model checking. View full abstract»

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

    Publication Year: 2015, Page(s):111 - 120
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    The vacuous satisfaction of a temporal formula with respect to a model has been extensively studied in the literature. Although a universally accepted definition of vacuity does not yet exist, all existing proposals generalize, in one way or another, the antecedent failure of an implication to the syntax of a temporal logic. They are therefore syntactic: whether a model vacuously satisfies a formu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global Caching for the Flat Coalgebraic µ-Calculus

    Publication Year: 2015, Page(s):121 - 130
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    Branching-time temporal logics generalizing relational temporal logics such as CTL have been proposed for various system types beyond the purely relational world. This includes, e.g., alternating-time logics, which talk about winning strategies over concurrent game structures, and Parikh's game logic, which is interpreted over monotone neighbourhood frames, as well as probabilistic fixpoint logics... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decidability via Mosaics for Bundled Ockhamist Logic

    Publication Year: 2015, Page(s):131 - 139
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    We adapt the 'mosaics' technique of Reynolds 1997 (in turn an adaption of Németi 1986) achieving decidability for the (non local) Ockhamist logic of (upward endless) bundled trees. We produce a double exponential time procedure, thus improving the complexity upper bound of the problem - so far relying on the non elementary procedure of the Rabin's Theorem (Burgess 1979). View full abstract»

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