Back to top
<nil>
Scope & Key Features
  • Since 1994, the TIME International Symposium brings together researchers from different disciplines of Computer Science working on temporal aspects of computational systems.
  • We are glad to announce that TIME will be back to an in-person conference! We look forward to welcoming the TIME community to Athens after 3 years of online events.
  • At least one author of each accepted paper must register early and physically attend TIME 2023 to present their work. Participants who are not giving a presentation may attend TIME 2023 remotely; of course, we strongly encourage physical participation!
  • In addition to theoretical work, we invite submissions focusing on the development, deployment and evaluation of systems for temporal reasoning. Such systems papers will be evaluated primarily on the quality of the empirical evaluation and reusability.
  • The authors of the top-ranked papers will be invited to submit an extended version of their contribution to a special issue in Information and Computation.
Topics

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

  • Time in Artificial Intelligence
  • Time in Data Science
  • Temporal Logic and Reasoning
  • Spatial and temporal reasoning
  • Time in natural language processing
  • Reasoning about action and change
  • Complex event recognition and forecasting
  • 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
  • Temporal Networks
Submissions & Publication

TIME 2023 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=time2023

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 2023 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.

Extended Abstracts

In addition to traditional papers, we invite submissions of extended abstracts presenting work-in-progress or summarising work that has been published elsewhere. The authors of the accepted extended abstracts will present their work at the symposium, while the extended abstracts will appear in the proceedings of TIME 2023.

Submission details: The submission should be a two-page extended abstract following the format for regular TIME 2023 papers. The extended abstract should present the main contributions of the work and discuss its relevance to TIME.

Submit your extended abstract here: https://easychair.org/conferences/?conf=time2023

Important dates:

  • Extended abstract submission deadline:
    		•  June 23, 2023, 23:59, AoE
  • Notification:
    		•  June 30, 2023
  • Final camera-ready version:
    		•  July 14, 2023

Important Dates
  • Abstract submission deadline:
    		•  April 28, May 18, 2023, 23:59, AoE
  • Paper submission deadline:
    		•  May 5, May 19, 2023, 23:59, AoE
  • Notifications:
    		•  June 16, June 30, 2023
  • Final camera-ready version:
    		•  July 14, 2023
  • Conference:
    		•  September 25-26, 2023
Registration

Registration is now open: https://pcoconvin.eventsair.com/timeworkshop/register

The registration cost for physical participation is 300 Euros. At least one author of each accepted paper must register and physically attend TIME 2023 to present their work.

Invited Talks

We are happy to announce that Thomas Eiter and Laura Nenzi have agreed to give an invited talk!

    Thomas Eiter, TU Vienna, Austria
    Title: Asynchronous Temporal Equilibrium Logic

    Abstract: Temporal Answer Set Programming is concerned with extending the stable models semantics of logic programs to a temporal setting, which may by fruitfully used for applications such as planning and reasoning about actions. The logical characerisation of stable models in terms of Equilibrium logic, in which models from the (monotonic) intermediate logic of Here-and-There are selected under a minimality condition, lends itself for defining a stable models variant of linear temporal logic (LTL) in terms of Temporal Equilibrium Logic (TEL), which selects traces from Temporal Here-and-There (THT) under a minimality condition that traces of the same length pointwise. We consider a stricter selection, which we call asynchronous TEL, where a trace can be smaller than another by making less atoms true or by reducing the number of transitions in the trace. In a way, the latter amounts to a contraction of the larger trace. We illustrate the effect on examples and and explore some properties of the notion, which may be used for summarisation and compact example construction, for instance. This is joint work with Pedro Cabalar from the University of A Coruna.

    Bio: Thomas Eiter is a professor in the Faculty of Informatics at the Vienna University of Technology (TU Wien), Austria, where he obtained his PhD in 1991 and heads the Knowledge-Based Systems Group and the Institute of Logic and Computation. He has been active in Computer Science and Artificial Intelligence, where he made contributions to knowledge representation and reasoning, e.g. in his work on reasoning with incomplete and/or inconsistent information, contextual reasoning, combining rules and ontologies, and to declarative problem solving. Eiter is an ACM Fellow, a Fellow of the European Association for AI, and Member of the Austrian and the European Academy of Sciences, respectively.
    Laura Nenzi, University of Trieste, Italy
    Title: Learning Temporal Logic Formulas from Time-series Data

    Abstract: The availability of data has spurred the utilization of machine learning techniques for system analysis. While these methods excel in complex, high-dimensional scenarios and generate powerful black-box models, they often lack uncertainty measures and fail to fully understand the underlying mechanisms. This limitation becomes especially crucial in safety-critical systems, where failures can be costly. Therefore, designers must comprehend system phenomena and extract meaningful knowledge from the data. To tackle this challenge, recent research has explored the application of learning Temporal Logic (TL) formulae as a means of extracting human-interpretable information. TL offers precise formal formulae that are easily comprehensible to humans and provides verification algorithms that can automatically evaluate the fulfillment of desired properties. In this talk, we provide an overview of recent advancements in this field, with a specific focus on learning Signal Temporal Logic (STL) formulae. STL is particularly well-suited for expressing properties related to real-time trajectories. We delve into supervised and semi-supervised learning problems, highlighting the utility of TL formulae, e.g. for anomaly detection. Additionally, we show how the consideration of spatial aspects in system behavior can be accomplished by using STREL, an extension of STL with a number of spatial operators.

    Bio: Laura Nenzi is an expert in formal verification. Her research is mainly focused on the design of temporal logics to specify and monitor large-scale spatially distributed systems. In the last few years, she is investigating the combination of formal verification with Bayesian and machine learning techniques. She is also working on explainable AI, designing methodologies for learning formal specifications from data. Since November 2021, she is an Assistant Professor (with tenure-track) at the Department of Engineering and Architecture at the University of Trieste, Italy. Before that, she had a part-time double position as Project Assistant at TU Wien Austria and Assistant Professor (without tenure-track) at the University of Trieste. She holds a Ph.D. degree in Computer Science from the IMT Lucca, Italy (2017) and a master’s degree in Mathematics from the University of Trieste (2012), both completed with the highest marks. She was co-PI of the project ZK-35: "High-dimensional statistical learning: new methods to advance economic and sustainability policies" (Total Funding ∼2 Mio Euro), within the Austrian Science Fund's (FWF) "Young Independent Researcher Groups" programme, for which she lead the TU participation. She received the Hedy Lamarr Award 2020 from the City of Vienna. The award recognizes women in Austria for their exceptional achievements in the field of information technology.
Program

You may find a tentative program for TIME 2023 below.

    Monday, 25 September 2023
    09:00 - 09:15
    Opening Slides
    09:15 - 10:15
    Invited talk: Thomas Eiter Asynchronous Temporal Equilibrium Logic
    10:15 - 10:45 Coffee Break
    10:45 - 12:15 Timed Logics & Temporal Reasoning
    Session Chair: Carlo Combi
    10:45 - 11:15 S. Shankar, S. Pinisetty, T. Jéron Bounded-Memory Runtime Enforcement of Timed Properties DOI Slides
    11:15 - 11:45 H. Ho, K. Madnani More Than 0s and 1s: Metric Quantifiers and Counting over Timed Words DOI
    11:45 - 12:15 M. Sioutis Embarrassingly Greedy Inconsistency Resolution of Qualitative Constraint Networks DOI Slides
    12:15 - 13:15 Lunch Break
    13:15 - 14:45 Temporal Logics
    Session Chair: Martin Lange
    13:15 - 13:45 A. Artale, L. Geatti, N. Gigante, A. Mazzullo, A. Montanari LTL over finite words can be exponentially more succinct than pure-past LTL, and vice versa DOI Slides
    13:45 - 14:15 L. Geatti, A. Gianola, N. Gigante Extended abstract: Towards Infinite-State Verification and Planning with Linear Temporal Logic Modulo Theories DOI Slides
    14:15 - 14:45 R. Acampora, L. Geatti, N. Gigante, A. Montanari Extended abstract: Qualitative Past Timeline-Based Games DOI Slides
    14:45 - 15:15 Coffee Break
    15:15 - 17:15 Temporal Graphs
    Session Chair: Florian Bruse
    15:15 - 15:45 A. Baudin, L. Tabourier, C. Magnien LSCPM: communities in massive real-world Link Streams by Clique Percolation Method DOI Slides
    15:45 - 16:15 A. Bregoli, K. Rathsman, M. Scutari, F. Stella, S.W. Mogensen Analyzing complex systems with cascades using continuous time Bayesian networks DOI Slides
    16:15 - 16:45 M. Sälzer, S. Beddar-Wiesing Extended abstract: Time-aware Robustness of Temporal Graph Neural Networks for Link Prediction DOI Slides
    16:45 - 17:15 L. Hunsberger, R. Posenato Extended abstract: Converting Simple Temporal Networks with Uncertainty into Dispatchable Form---Faster DOI Slides
    19:00 Dinner


    Tuesday, 26 September 2023
    09:00 - 10:00
    Invited talk: Laura Nenzi Learning Temporal Logic Formulas from Time-series Data DOI Slides
    10:00 - 10:30 Coffee Break
    10:30 - 12:30 Causality Detection & Temporal Databases
    Session Chair: Luke Hunsberger
    10:30 - 11:00 A. Misra, A. Kshemkalyani Detecting Causality in the Presence of Byzantine Processes: The Synchronous Systems Case DOI Slides
    11:00 - 11:30 B. Amico, C. Combi, R. Rizzi, P. Sala Discovering predictive dependencies on multi-temporal relations DOI Slides
    11:30 - 12:00 C. Dyreson Optimization of Nonsequenced Queries using Log-Segmented Timestamps DOI Slides
    12:00 - 12:30 C. Akasiadis, E. Kladis, P. Kamberi Extended abstract: A Benchmark for Early Time-Series Classification DOI Slides
    12:30 - 13:30 Lunch Break
    13:30 - 15:30 Interval Temporal Logic & Event Recognition
    Session Chair: Angelo Montanari
    13:30 - 14:00 W. Conradie, R. Monego, E. Muñoz-Velasco, G. Sciavicco, I.E. Stan A Sound and Complete Tableau System for Fuzzy Halpern and Shoham’s Interval Temporal Logic DOI Slides
    14:00 - 14:30 N. Giatrakos Extended abstract: SSTRESED: Scalable Semantic Trajectory Extraction for Simple Event Detection over Streaming Movement Data DOI Slides Slides (ppt)
    14:30 - 15:00 P. Mantenoglou Extended abstract: An Event Calculus for Run-Time Reasoning DOI Slides
    15:00 - 15:30 N. Katzouris, G. Paliouras Extended abstract: Answer Set Automata: A Learnable Pattern Specification Framework for Complex Event Recognition DOI Slides
    15:30 - 16:00 Coffee Break
    16:00 - 17:30 Qualitative Spatial and Temporal Reasoning
    Session Chair: Alexander Artikis
    16:00 - 16:30 Y. Salhi, M. Sioutis Prime Scenarios in Qualitative Spatial and Temporal Reasoning DOI Slides
    16:30 - 17:00 F. Bruse, M. Kastaun, M. Lange, S. Möller The Calculus of Temporal Influence DOI Slides
    17:00 - 17:30 Y. Salhi, M. Sioutis Extended abstract: A Decomposition Framework for Inconsistency Handling in Qualitative Spatial and Temporal Reasoning DOI Slides
    17:30 - 17:45
    Closing Remarks


Program Committee Members
Steering Committee
Sponsors