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 23 matches
- 2008
- David A. Basin, Carlos Caleiro, Jaime Ramos, Luca Viganò:
A Labeled Tableaux Systemfor the Distributed Temporal Logic DTL. TIME 2008: 101-109 - Alberto Belussi, Carlo Combi, Gabriele Pozzani:
Towards a Formal Framework for Spatio-Temporal Granularities. TIME 2008: 49-53 - Florent Bouchy, Alain Finkel, Jérôme Leroux:
Decomposition of Decidable First-Order Logics over Integers and Reals. TIME 2008: 147-155 - Laura Bozzelli:
The Complexity of CaRet + Chop. TIME 2008: 23-31 - Davide Bresolin, Angelo Montanari, Pietro Sala:
An optimal tableau for Right Propositional Neighborhood Logic over Trees. TIME 2008: 110-117 - Thomas Brihaye, Nicolas Markey, Mohamed Ghannem, Lionel Rieg:
Good Friends are Hard to Find! TIME 2008: 32-40 - Hui Ding, Goce Trajcevski, Peter Scheuermann:
Efficient Similarity Join of Large Sets of Moving Object Trajectories. TIME 2008: 79-87 - Clare Dixon, Michael Fisher, Boris Konev, Alexei Lisitsa:
Practical First-Order Temporal Reasoning. TIME 2008: 156-163 - Ivo Düntsch, Michael Winter:
Moving Spaces. TIME 2008: 59-63 - Juozas Gordevicius, Johann Gamper, Michael H. Böhlen:
A Greedy Approach Towards Parsimonious Temporal Aggregation. TIME 2008: 88-92 - Sylvain Hallé, Roger Villemaire:
Satisfying a Fragment of XQuery by Branching-Time Reduction. TIME 2008: 72-76 - Bernhard Heinemann:
Regarding Overlapping as a Basic Concept of Subset Spaces. TIME 2008: 41-45 - Kothuri Venkata Ravi Kanth, Robert Hanckel, Aravind Yalamanchi:
Using Oracle Extensibility Framework for Supporting Temporal and Spatio-Temporal Applications. TIME 2008: 15-18 - Romans Kasperovics, Michael H. Böhlen, Johann Gamper:
Representing Public Transport Schedules as Repeating Trips. TIME 2008: 54-58 - Yuechang Liu, Yunfei Jiang, Hong Qian:
Topology-based Variable Ordering Strategy for Solving Disjunctive Temporal Problems. TIME 2008: 129-136 - Carsten Lutz, Frank Wolter, Michael Zakharyaschev:
Temporal Description Logics: A Survey. TIME 2008: 3-14 - Frederic Maris, Pierre Régnier:
TLP-GP: Solving Temporally-Expressive Planning Problems. TIME 2008: 137-144 - Farid Nouioua:
A Heuristic Approach to Order Events in Narrative Texts. TIME 2008: 67-71 - Bashar Saleh, Florent Masseglia:
Time Aware Mining of Itemsets. TIME 2008: 93-97 - Sergey Tverdyshev, Eyad Alkassar:
Efficient Bit-Level Model Reductions for Automated Hardware Verification. TIME 2008: 164-172 - Luca Viganò, Marco Volpe:
Labeled Natural Deduction Systems for a Family of Tense Logics. TIME 2008: 118-126 - James Worrell:
Real-Time Model Checking: Algorithms and Complexity. TIME 2008: 19 - Stéphane Demri, Christian S. Jensen:
15th International Symposium on Temporal Representation and Reasoning, TIME 2008, Université du Québec à Montréal, Canada, 16-18 June 2008. IEEE Computer Society 2008, ISBN 978-0-7695-3181-6 [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-09-20 02:27 CEST 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