default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2018
- George Athanasopoulos, George Paliouras, Dimitrios Vogiatzis, Grigorios Tzortzis, Nikos Katzouris:
Predicting the Evolution of Communities with Online Inductive Logic Programming. TIME 2018: 4:1-4:20 - Michael H. Böhlen, Anton Dignös, Johann Gamper, Christian S. Jensen:
Database Technology for Processing Temporal Data (Invited Paper). TIME 2018: 2:1-2:7 - Alexander Bolotov, Montserrat Hermo, Paqui Lucio:
Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach. TIME 2018: 5:1-5:22 - Laura Bozzelli, Aniello Murano, Loredana Sorrentino:
Results on Alternating-Time Temporal Logics with Linear Past. TIME 2018: 6:1-6:22 - Davide Bresolin, Enrico Cominato, Simone Gnani, Emilio Muñoz-Velasco, Guido Sciavicco:
Extracting Interval Temporal Logic Rules: A First Approach. TIME 2018: 7:1-7:15 - Massimo Cairo, Luke Hunsberger, Romeo Rizzi:
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. TIME 2018: 8:1-8:16 - Carlo Combi, Roberto Posenato:
Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty. TIME 2018: 9:1-9:16 - Carlo Comin, Romeo Rizzi:
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. TIME 2018: 10:1-10:20 - Stéphane Demri:
On Temporal and Separation Logics (Invited Paper). TIME 2018: 1:1-1:4 - Andreas Dohr, Christiane Engels, Andreas Behrend:
Algebraic Operators for Processing Sets of Temporal Intervals in Relational Databases. TIME 2018: 11:1-11:16 - Marco Gavanelli, Alessandro Passantino, Guido Sciavicco:
Deciding the Consistency of Branching Time Interval Networks. TIME 2018: 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. TIME 2018: 13:1-13:17 - Luke Hunsberger, Roberto Posenato:
Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty. TIME 2018: 14:1-14:17 - Luke Hunsberger, Roberto Posenato:
Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking. TIME 2018: 15:1-15:15 - Wojciech Jamroga:
Model Checking Strategic Ability - Why, What, and Especially: How? (Invited Paper). TIME 2018: 3:1-3:10 - Daniel Kernberger, Martin Lange:
On the Expressive Power of Hybrid Branching-Time Logics. TIME 2018: 16:1-16:18 - Malte S. Kließ, Catholijn M. Jonker, M. Birna van Riemsdijk:
A Temporal Logic for Modelling Activities of Daily Living. TIME 2018: 17:1-17:15 - Julius Köpke, Johann Eder, Jianwen Su:
GSM+T: A Timed Artifact-Centric Process Model. TIME 2018: 18:1-18:15 - Malek Mouhoub, Hamad Al Marri, Eisa Alanazi:
Learning Qualitative Constraint Networks. TIME 2018: 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. TIME 2018: 20:1-20:17 - Pattreeya Tanisaro, Gunther Heidemann:
An Empirical Study on Bidirectional Recurrent Neural Networks for Human Motion Recognition. TIME 2018: 21:1-21:19 - Lewis Tolonen, Tim French, Mark Reynolds:
Population Based Methods for Optimising Infinite Behaviours of Timed Automata. TIME 2018: 22:1-22:22 - Przemyslaw Andrzej Walega:
Computational Complexity of a Core Fragment of Halpern-Shoham Logic. TIME 2018: 23:1-23:18 - Front Matter, Table of Contents, Preface, Conference Organization. TIME 2018: 0:i-0:xiv
- 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 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-06 11:23 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint