2013 20th International Symposium on Temporal Representation and Reasoning

26-28 Sept. 2013

Filter Results

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

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

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

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

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

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

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

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

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

    Publication Year: 2013, Page(s):xi - xii
    Request permission for reuse | PDF file iconPDF (161 KB)
    Freely Available from IEEE
  • Rethinking Logics of Action and Time

    Publication Year: 2013, Page(s):3 - 4
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    It is over thirty years since I developed interval temporal logic and the accompanying logic of action and time. Overall, these theories have held up well and, with some extensions over the years, have remained useful in our work on AI planning/reasoning systems and natural language understanding. Recently I have become interested in systems that can learn by reading, and specifically, that can le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental, Inductive Model Checking

    Publication Year: 2013, Page(s):5 - 6
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    IC3, a model checking algorithm for invariance properties, has inspired a fair amount of research since it was first noticed in 2011 and is now widely used in the EDA industry. It is rooted in the deductive approach to verification, central to which is the application of mathematical induction. IC3 applies induction in two ways: in the typical manner, to detect convergence to an inductive strength... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatio-temporal Competition for Transportation Resources

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

    A lot of work has been devoted to collaboration among distributed computing devices. Sensor networks and crowdsourcing are prominent examples of distributed collaborative computing. Much less attention has been paid to competition among computing agents, particularly the type that we call spatio-temporal competition. In it mobile agents compete for point resources located in space. An example of s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal Consistency Problem of Temporal Qualitative Constraint Networks

    Publication Year: 2013, Page(s):11 - 18
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (487 KB) | HTML iconHTML

    Various formalisms for representing and reasoning about temporal information with qualitative constraints have been studied in the past three decades. The most known are definitely the Point Algebra (PA) and the Interval Algebra (IA) proposed by Allen. In this paper, for both calculi, we study a particular problem that we call minimal consistency problem (MinCons). Given a temporal qualitative con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Design of Consistent Simple Temporal Networks

    Publication Year: 2013, Page(s):19 - 25
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (466 KB) | HTML iconHTML

    Simple Temporal Networks (STNs) are used in many applications, as they provide a powerful and general tool for representing conjunctions of minimum and maximum distance constraints between pairs of temporal variables. During construction of an STN, it is possible that the network presents some constraint violations that need to be resolved. One way to solve such violations is to remove a minimal n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Faster Execution Algorithm for Dynamically Controllable STNUs

    Publication Year: 2013, Page(s):26 - 33
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (479 KB) | HTML iconHTML

    A Simple Temporal Network with Uncertainty (STNU) is a data structure for representing and reasoning about temporal constraints where the durations of certain temporal intervals-the contingent links-are only discovered during execution. The most important property of anSTNU is whether it is dynamically controllable (DC)-that is, whether there exists a strategy for executing time-points that will g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relaxation of Temporal Planning Problems

    Publication Year: 2013, Page(s):37 - 44
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    Relaxation is ubiquitous in the practical resolution of combinatorial problems. If a valid relaxation of an instance has no solution then the original instance has no solution. A tractable relaxation can be built and solved in polynomial time. The most obvious application is the efficient detection of certain unsolvable instances. We review existing relaxation techniques in temporal planning and p... View full abstract»

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

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

    We propose an approach for defining labeled natural deduction systems for the class of Peircean branching temporal logics, seen as logics in their own right rather than as sub logics of Ockhamist systems. In particular, we give a system for the logic UB, i.e., the until-free fragment of CTL, and show that it is sound and complete. We also study normalization and discuss how derivations may reduce ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting Unsatisfiable Cores for LTL via Temporal Resolution

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

    Unsatisfiable cores (UCs) are a well established means for debugging in a declarative setting. Still, tools that perform automated extraction of UCs for LTL are scarce. Using resolution graphs to extract UCs is common in many domains. In this paper we construct and optimize resolution graphs for temporal resolution as implemented in the temporal resolution-based solver TRP++ and we use them to ext... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Complete Classification of the Expressiveness of Interval Logics of Allen's Relations over Dense Linear Orders

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

    Interval temporal logics are temporal logics that take time intervals, instead of time instants, as their primitive temporal entities. One of the most studied interval temporal logics is Halpern and Shoham's modal logic of time intervals (HS), which has a distinct modality for each binary relation between intervals over a linear order. As HS turns out to be undecidable over most classes of linear ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Metric Temporal Logic for Hybrid Systems

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

    We introduce a new way of defining metric temporal logic over the continuous real model of time. The semantics refer to a single universal clock in order to impose metric constraints to any desired precision. Furthermore, the expression of any non-metric aspects can correctly utilise the full power of continuous time temporal logic. Syntactic constructs afford the convenient succinct expression of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebraic System of Temporal Structures

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

    Lauchli and Leonard, in 1966, described a series of operations which are able to build all linear temporal structures up to first order equivalence. More recently these operations have been used to describe executions of continuous systems for the purposes of model checking real-time specifications. In this paper we present an algebra over these operations and show that it is both sound and comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LTL Satisfiability Checking Revisited

    Publication Year: 2013, Page(s):91 - 98
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (420 KB) | HTML iconHTML

    We propose a novel algorithm for the satisfiability problem for Linear Temporal Logic (LTL). Existing approaches first transform the LTL formula into a B"uchi automaton and then perform an emptiness checking of the resulting automaton. Instead, our approach works on-the-fly by inspecting the formula directly, thus enabling finding a satisfying model quickly without constructing the full automaton.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tool for Deciding the Satisfiability of Continuous-Time Metric Temporal Logic

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

    Constraint LTL-over-clocks is a variant of CLTL, an extension of linear-time temporal logic allowing atomic assertions in a concrete constraint system. Satisfiability of CLTL-over-clocks is here shown to be decidable by means of a reduction to a decidable SMT (Satisfiability Modulo Theories) problem. The result is a complete Bounded Satisfiability Checking procedure, which has been implemented by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of Model Checking over General Linear Time

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

    Temporal logics over general linear time allow us to capture continuous properties in applications such as distributed systems, natural language, message passing and A.I. modelling of human reasoning. Linear time structures, however, can exhibit a wide range of behaviours that are hard to reason with, or even describe finitely. Recently, a formal language of Model Expressions has been proposed to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Approach to Abstract Reachability State Space of Time Petri Nets

    Publication Year: 2013, Page(s):117 - 124
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (391 KB) | HTML iconHTML

    Time Petri nets (TPN model) allow the specification of real-time systems involving explicit timing constraints. The main challenge of the analysis of such systems is to construct, with few resources (time and space), a coarse abstraction preserving timed properties. In this paper, we propose a new finite graph, called Timed Aggregate Graph (TAG), abstracting the behaviour of bounded TPNs with stro... View full abstract»

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