Back to top
TIME 2022<br> 29th International Symposium on Temporal Representation and Reasoning

TIME 2022
29th International Symposium on Temporal Representation and Reasoning

07-09 November, 2022 - Online

Scope & Key Features
  • Since 1994, the TIME International Symposium on Temporal Representation and Reasoning aims to bring together researchers in the area of temporal representation and reasoning from different disciplines of Computer Science.
  • TIME 2022 will be organized as a combination of technical paper presentations, and keynote talks.
  • Besides sustaining the traditional three tracks (Time in Artificial Intelligence, Temporal Databases, and Temporal Logic and Reasoning), TIME 2022 in particular wants to stimulate cross-cutting concerns.
  • TIME 2022 will be held as an online conference.
  • The authors of the top-ranked papers will be invited to submit an extended version of their contribution to a special issue in Information Systems or Information and Computation.
Tracks
  • Time in Artificial Intelligence
  • Temporal Databases
  • Temporal Logic and Reasoning
Topics

Topics for TIME 2022 include (but are not limited to):

  • Spatial and temporal reasoning
  • Time in natural language processing
  • Spatio-temporal knowledge representation systems
  • Reasoning about actions and change
  • Planning and planning languages
  • Ontologies of time and space-time
  • Belief and uncertainty in temporal knowledge
  • Temporal learning and discovery
  • Temporal data models and query languages
  • Temporal query processing and indexing
  • Temporal data mining
  • Time series data management
  • Stream data management
  • Spatio-temporal data management, including moving objects
  • Data currency and expiration
  • Indeterminate and imprecise temporal data
  • Temporal constraints
  • Specification and verification of systems
  • Verification of software and web applications
  • Synthesis and execution
  • Model checking algorithms and implementations
  • Temporal logics for infinite-state systems
  • Runtime verification of temporal properties
  • Temporal aspects of agent- and policy-based systems
  • Complex event recognition and forecasting
  • Temporal Networks
Submissions & Publication

TIME 2022 accepts submissions in PDF format, no longer than 12 pages excluding references and appendix. The appendix is limited to 5 pages, and the reviewers may or may not take it into account for their recommendation. Submissions must be formatted following the LIPIcs instructions: https://submission.dagstuhl.de/documentation/authors, and preferably redacted in LaTex.

Submit your paper here: https://easychair.org/conferences/?conf=time22

TIME policy is single blind, so the names of the authors need not be hidden in the submitted draft. Members of the program committee are allowed to submit papers. Submitted papers will be refereed for quality, correctness, originality, and relevance to the conference.

Submissions to TIME 2022 must be original; parallel submissions of the same material to other conferences or journals are not allowed. Accepted papers will be presented at the symposium and included in the proceedings, which will be published by LIPIcs-Leibniz International Proceedings in Informatics: https://www.dagstuhl.de/en/publications/lipics/. This is a series of high-quality peer-reviewed conference proceedings, and published according to the principle of OpenAccess. At least one author of each accepted paper must register at the conference and present the paper.

The authors of the top-ranked papers will be invited to submit an extended version of their contribution to a special issue in Information Systems or Information and Computation.

Registration

Registration to TIME 2022 is free.

Important Dates
  • Abstracts due:
  • June 19, 2022, 23:59, AoE June 26, 2022, 23:59, AoE
  • Papers due:
  • June 26, 2022, 23:59, AoE July 3, 2022, 23:59, AoE
  • Notification:
  • August 01, 2022
  • Final camera-ready version:
  • August 25, 2022
  • Conference:
  • November 07-09, 2022
Program Committee Members
Steering Committee
Program

All times are in the CET timezone.

    Monday, 07 November 2022
    14:15 - 14:30 Opening
    14:30 - 15:30 Invited talk: Moshe Vardi
    15:30 - 15:50 Coffee Break
    15:50 - 16:40 Runtime Verification
    15:50 - 16:15 I. Mackey, R. Chimni, J. Su Early Detection of Temporal Constraint Violations
    16:15 - 16:40 V. Roussanaly, Y. Falcone Decentralised Runtime Verification of Timed Regular Expressions
    16:40 - 17:00 Coffee Break
    17:00 - 17:50 Timed Temporal Logics
    17:00 - 17:25 F. Bruse, M. Lange, E. Lozes The Tail-Recursive Fragment of Timed Recursive CTL
    17:25 - 17:50 T. Guyet, N. Markey Logical forms of chronicles


    Tuesday, 08 November 2022
    14:30 - 15:30 Invited talk: Silvia Miksch
    15:30 - 15:50 Coffee Break
    15:50 - 16:40 Extensions of LTL and Reasoning
    15:50 - 16:15 A. Bhaskar, M. Praveen Realizability Problem for Constraint LTL
    16:15 - 16:40 N. Peltier Reasoning on Dynamic Transformations of Symbolic Heaps
    16:40 - 17:00 Coffee Break
    17:00 - 17:50 Interval Temporal Logics
    17:00 - 17:25 D. Guelev Gabbay Separation for the Duration Calculus
    17:25 - 17:50 L. Bozzelli, A. Peron A quantitative extension of Interval Temporal Logic over infinite words


    Wednesday, 09 November 2022
    14:30 - 15:30 Invited talk: Stijn Vansummeren
    15:30 - 15:50 Coffee Break
    15:50 - 16:40 Neuro-Symbolic Reasoning
    15:50 - 16:15 G. Apriceno, A. Passerini, L. Serafini A neuro-symbolic approach for real-world event recognition from weak supervision
    16:15 - 16:40 G. Pagliarini, S. Scaboro, G. Serra, G. Sciavicco, I. E. Stan Neural-Symbolic Temporal Decision Trees for Multivariate Time Series Classification
    16:40 - 17:00 Coffee Break
    17:00 - 17:50 Time in Artificial Intelligence
    17:00 - 17:25 M. Benerecetti, F. Mogavero, A. Peron Taming Strategy Logic: Non-Recurrent Fragments
    17:25 - 17:50 J. Gutierrez, S. Kraus, G. Perelli, M. Wooldridge Giving Instructions in Linear Temporal Logic
Invited Talks
    Moshe Y. Vardi, Rice University, USA
    Title: Linear Temporal Logic: From Infinite to Finite Horizon

    Abstract: Linear Temporal Logic (LTL), proposed in 1977 by Amir Pnueli for reasoning about ongoing programs, was defined over infinite traces. The motivation for this was the desire to model arbitrarily long computations. While this approach has been highly successful in the context of model checking, it has been less successful in the context of reactive synthesis, due to the challenging algorithmics of infinite-horizon temporal synthesis. In this talk we show that focusing on finite-horizon temporal synthesis offers enough algorithmic advantages to compensate for the loss in expressiveness. In fact, finite-horizon reasonings is useful even in the context of infinite-horizon applications.

    Silvia Miksch, Vienna University of Technology (TU Wien), Austria
    Title: Visual Analytics Meets Temporal Reasoning: Challenges and Opportunities

    Abstract: Visual Analytics integrates the outstanding capabilities of humans in terms of visual information exploration with the enormous processing power of computers to form powerful information and knowledge discovery environments. In other words, Visual Analytics is the science of analytical reasoning facilitated by interactive interfaces and captures the information discovery process keeping the human in the loop as well as gaining deeper insights into huge heterogeneous and complex data sources. Time is an important data dimension with distinct characteristics. Time is common across many application domains (e.g., medical records, planning, or project management). In contrast to other quantitative data dimensions, which are usually “flat”, time has an inherent semantic structure, which increases time’s complexity substantially. The hierarchical structure of granularities in time (e.g., minutes, hours, days, weeks, or months), is unlike that of most other quantitative dimensions. Specifically, time comprises different forms of divisions (e.g., 60 minutes correspond to one hour, while 24 hours make up one day), and granularities are combined to form calendar systems (e.g., Gregorian, Julian, business, or academic calendars). Moreover, time contains natural cycles and re-occurrences, as for example seasons, but also social (often irregular) cycles, like holidays or school breaks. Therefore, time-oriented data, i.e., data that are inherently linked to time, need to be treated differently than other kinds of data and require appropriate visual, interactive, and analytical methods to explore and analyze them.

    In this talk, I will illustrate the concepts of Visualization and Visual Analytics. I will characterize the dimension of time as well as time-oriented data as well as describe tasks that users seek to accomplish using temporal Visual Analytics methods. I will address three key questions: “what” is visualized, “why” is it visualized, and “how” it is visualized. Various examples will illustrate what has been achieved so far and show possible future directions and challenges.

    Stijn Vansummeren, University of Hasselt, Belgium
    Title: Getting to the CORE of Complex Event Recognition

    Abstract: Complex Event Recognition (CER for short) refers to the activity of processing high-velocity streams of primitive events by evaluating queries that detect complex events: collections of primitive events that satisfy some pattern. In particular, CER queries match incoming events on the basis of their content; where they occur in the input stream; and how this order relates to other events in the stream. CER has been successfully applied in diverse domains such as maritime monitoring, network intrusion detection, industrial control systems and real-time analytics.

    In this talk, I will survey our recent work on developing a formal framework for specifying and evaluating CER queries and will explain in particular a novel CER evaluation algorithm whose complexity is provably asymptotically optimal. The implementation of this algorithm in the CORE COmplex event Recognition Engine shows that in practice the algorithm exhibits stable query performance, even for long sequence queries and large time windows, and outperforms existing systems by up to five orders of magnitude on different workloads.

    I will discuss the essential ideas behind both the supported query language and evaluation algorithm, as well as their limitations, and from these limitations discuss open questions relevant for the TIME community.

Sponsors