default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th TIME 2018: Warsaw, Poland
- Natasha Alechina, Kjetil Nørvåg, Wojciech Penczek:
25th International Symposium on Temporal Representation and Reasoning, TIME 2018, Warsaw, Poland, October 15-17, 2018. LIPIcs 120, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-089-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Stéphane Demri:
On Temporal and Separation Logics (Invited Paper). 1:1-1:4 - Michael H. Böhlen
, Anton Dignös, Johann Gamper, Christian S. Jensen:
Database Technology for Processing Temporal Data (Invited Paper). 2:1-2:7 - Wojciech Jamroga:
Model Checking Strategic Ability - Why, What, and Especially: How? (Invited Paper). 3:1-3:10 - George Athanasopoulos, George Paliouras, Dimitrios Vogiatzis, Grigorios Tzortzis, Nikos Katzouris:
Predicting the Evolution of Communities with Online Inductive Logic Programming. 4:1-4:20 - Alexander Bolotov, Montserrat Hermo, Paqui Lucio:
Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach. 5:1-5:22 - Laura Bozzelli, Aniello Murano, Loredana Sorrentino:
Results on Alternating-Time Temporal Logics with Linear Past. 6:1-6:22 - Davide Bresolin, Enrico Cominato, Simone Gnani, Emilio Muñoz-Velasco, Guido Sciavicco:
Extracting Interval Temporal Logic Rules: A First Approach. 7:1-7:15 - Massimo Cairo, Luke Hunsberger, Romeo Rizzi:
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. 8:1-8:16 - Carlo Combi, Roberto Posenato:
Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty. 9:1-9:16 - Carlo Comin, Romeo Rizzi:
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. 10:1-10:20 - Andreas Dohr, Christiane Engels, Andreas Behrend:
Algebraic Operators for Processing Sets of Temporal Intervals in Relational Databases. 11:1-11:16 - Marco Gavanelli, Alessandro Passantino, Guido Sciavicco:
Deciding the Consistency of Branching Time Interval Networks. 12:1-12:15 - Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini, Mark Reynolds:
A Game-Theoretic Approach to Timeline-Based Planning with Uncertainty. 13:1-13:17 - Luke Hunsberger, Roberto Posenato:
Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty. 14:1-14:17 - Luke Hunsberger, Roberto Posenato:
Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking. 15:1-15:15 - Daniel Kernberger, Martin Lange:
On the Expressive Power of Hybrid Branching-Time Logics. 16:1-16:18 - Malte S. Kließ, Catholijn M. Jonker, M. Birna van Riemsdijk:
A Temporal Logic for Modelling Activities of Daily Living. 17:1-17:15 - Julius Köpke, Johann Eder, Jianwen Su:
GSM+T: A Timed Artifact-Centric Process Model. 18:1-18:15 - Malek Mouhoub, Hamad Al Marri, Eisa Alanazi:
Learning Qualitative Constraint Networks. 19:1-19:13 - Georgios M. Santipantakis, Akrivi Vlachou, Christos Doulkeridis, Alexander Artikis, Ioannis Kontopoulos, George A. Vouros:
A Stream Reasoning System for Maritime Monitoring. 20:1-20:17 - Pattreeya Tanisaro, Gunther Heidemann:
An Empirical Study on Bidirectional Recurrent Neural Networks for Human Motion Recognition. 21:1-21:19 - Lewis Tolonen, Tim French, Mark Reynolds:
Population Based Methods for Optimising Infinite Behaviours of Timed Automata. 22:1-22:22 - Przemyslaw Andrzej Walega:
Computational Complexity of a Core Fragment of Halpern-Shoham Logic. 23:1-23:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-10 18:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
