2012 19th International Symposium on Temporal Representation and Reasoning

12-14 Sept. 2012

Filter Results

Displaying Results 1 - 25 of 29
  • [Cover art]

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

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

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

    Publication Year: 2012, Page(s): iv
    Request permission for reuse | PDF file iconPDF (131 KB)
    Freely Available from IEEE
  • Message from Chairs

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

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

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

    Publication Year: 2012, Page(s): xi
    Request permission for reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Undecidability and Temporal Logic: Some Landmarks from Turing to the Present

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

    This is a selective survey and discussion of some of the landmark undecidability results in temporal logic, beginning with Turing's undecidability of the Halting problem which, in retrospect, can be regarded as the historically first undecidability result for a suitable temporal logic over configuration graphs of Turing machines. I will discuss some of the natural habitats of undecidable temporal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning about Plan Revision in Agent Programs

    Publication Year: 2012, Page(s): 5
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (84 KB) | HTML iconHTML

    This talk is on reasoning about agent programs written in Belief, Desire and Intention (BDI) agent programming languages. BDI programming languages (for example, [1], [2], [3]) have high-level programming primitives which correspond to the beliefs, goals and plans of an AI agent. A program contains a set of rules which allow the agent to adopt plans given its current beliefs and goals. Plans are e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatio-temporal Data Warehouses and Mobility Data: Current Status and Research Issues

    Publication Year: 2012, Page(s):6 - 9
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (139 KB) | HTML iconHTML

    Applications using mobility data are blooming in almost every application domain. Many research efforts have been devoted to developing concepts, models, theories, and tools to properly apprehend mobility data and make it manageable for the benefit of these applications. One particular aspect in this respect concerns mobility data management, i.e., storing mobility data in a data warehouse for the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Regular Linear Temporal Logic Using Dualization and Stratification

    Publication Year: 2012, Page(s):13 - 20
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    We study efficient translations of Regular Linear Temporal Logic (RLTL) into automata on infinite words. RLTL is a temporal logic that fuses Linear Temporal Logic (LTL) with regular expressions, extending its expressive power to all ω-regular languages. The first contribution of this paper is a novel bottom up translation from RLTL into alternating parity automata of linear size that requires only... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symmetric Temporal Theorem Proving

    Publication Year: 2012, Page(s):21 - 28
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (201 KB) | HTML iconHTML

    In this paper we consider the deductive verification of propositional temporal logic specifications of symmetric systems. In particular, we provide a heuristic approach to the scalability problems associated with analysing properties of large numbers of processes. Essentially, we use a temporal resolution procedure to verify properties of a system with few processes and then generalise the outcome... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tableau for the Combination of CTL and BCTL

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

    It is known that there is an exponential decision procedure for CTL. Given that important properties cannot be expressed in CTL, we seek a pure tableau based decision procedure (that does not rely on translations into automata) that is exponential for formulas that have only a bounded number of non-CTL properties. In this paper we present such a tableau for a combination of CTL and a bundled varia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Tableau System for the Logic of Temporal Neighborhood over the Reals

    Publication Year: 2012, Page(s):39 - 46
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    The propositional logic of temporal neighborhood (PNL) features two modalities that make it possible to access intervals adjacent to the right and to the left of the current one. PNL has been extensively studied in the last years. In particular, decidability and complexity of its satisfiability problem have been systematically investigated, and optimal decision procedures have been developed, for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Integrated First-Order Theory of Points and Intervals: Expressive Power in the Class of All Linear Orders

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

    There are two natural and well-studied approaches to temporal ontology and reasoning, that is, point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals. Recently, a two-sorted point-interval temporal logic in a modal framework in which time instants (points) and time periods (intervals) are considered on a par has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compositional Refinement for Real-Time Systems with Priorities

    Publication Year: 2012, Page(s):57 - 64
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (215 KB) | HTML iconHTML

    High-level requirements of real-time systems like as time constraints, communications and execution schedulability make the verification of real-time models arduous, where a system is the interaction of a possibly unbounded set of components. Priorities have been introduced to resolve execution conflicts, and by that, prevent the combinatorial explosion of state space. In this paper, we are intere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Modeling and Analysis of a Distributed Transaction Protocol in UPPAAL

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

    We present a formal analysis of the well-known two phase atomic commitment protocol. The protocol is modeled as networks of timed automata using the model checker UPPAAL. The protocol has been verified in two different crash models, the crash-stop model, and the crash-recovery model. The paper also describes how dense-timed model checking technology may be applied to discover the worst case execut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robustness Analysis for Scheduling Problems Using the Inverse Method

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

    Given a Parametric Timed Automaton (PTA) A and a reference valuation for timings, the Inverse Method (IM) synthesizes a constraint around the reference valuation where A behaves in the same time-abstract manner. This provides us with a quantitative measure of robustness of the behavior of A around the reference valuation. We show in this paper how IM can be applied in a specific way to treat the r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Metric Temporal Logic for Dealing with Zero-Time Transitions

    Publication Year: 2012, Page(s):81 - 88
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (237 KB) | HTML iconHTML

    Many industrial systems include components interacting with each other that evolve with possibly very different speeds. To deal with this situation many formalisms adopt the abstraction of ``zero-time transitions'', which do not consume time. These, however, have several drawbacks in terms of naturalness and logic consistency, as a system is modeled to be in different states at the same time. We i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automata-based Verification of Linear Temporal Logic Models with Bounded Variability

    Publication Year: 2012, Page(s):89 - 96
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    A model has variability bounded by v/k when the state changes at most v times over any linear interval containing k time instants. When interpreted over models with bounded variability, specification formulae that contain redundant metric information -- through the usage of next operators -- can be simplified without affecting their validity. This paper shows how to harness this simplification in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction

    Publication Year: 2012, Page(s):99 - 106
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    The first-order theory of dense linear orders without endpoints is well-known to be PSPACE-complete. We present polynomial-time tractability results for fragments of this theory which are defined by syntactic restriction, in particular, our fragments can be described using the framework of quantified constraint satisfaction over Ord-Horn clauses. View full abstract»

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

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

    In corpus linguistics obtaining high-quality semantically-annotated corpora is a fundamental goal. Various annotations of the same text can be obtained from automated systems, human annotators, or a combination of both. Obtaining, by manual means, a merged annotation from these, which improves the correctness of each individual annotation, is costly. We present automatic algorithms specifically fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Review on Temporal Reasoning Using Support Vector Machines

    Publication Year: 2012, Page(s):114 - 121
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    Recently, Support Vector Machines have presented promissing results to various machine learning tasks, such as classification and regression. These good results have motivated its application to several complex problems, including temporal information analysis. In this context, some studies attempt to extract temporal features from data and submit these features in a vector representation to tradi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal Implications of Database Information Accountability

    Publication Year: 2012, Page(s):125 - 132
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    Information restriction controls access and renders records immutable, information accountability requires data transparency to easily and efficiently determine when a particular use is appropriate. Information accountability in the context of relational databases is associated with time in a surprising number of ways, as is summarized in this paper. Notarization and validation of a database explo... View full abstract»

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