default search action
12th TIME 2005: Burlington, Vermont, USA
- 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 23-25 June 2005, Burlington, Vermont, USA. IEEE Computer Society 2005, ISBN 0-7695-2370-6
Introduction
- Message from the Chairs.
- Conference Organization.
- External Referees.
Invited Talks
- Patrice Godefroid:
Generalized Model Checking. 3 - Betty Salzberg:
Indexing Inventory Snapshots. 4 - James Pustejovsky:
Time and the Semantic Web. 5-8
Temporal Representation and Reasoning in AI
- Philippe Muller, Axel Reymonet:
Using Inference for Evaluating Models of Temporal Discourse. 11-19 - Claudio Bettini, Sergio Mascetti:
An Efficient Algorithm for Minimizing Time Granularity Periodical Representations. 20-25 - Krzysztof R. Apt, Sebastian Brand:
Constraint-Based Qualitative Simulation. 26-34 - Mahat Khelfallah, Belaid Benhamou:
A Local Method for Prioritized Fusion of Temporal Information. 35-43
Temporal Databases
- Fusheng Wang, Carlo Zaniolo, Xin Zhou:
Temporal XML? SQL Strikes Back! 47-55 - Amal El-Nahas, Omar H. Karam, Ahmad Hamad, Ingy Ramzy:
"TellMe": A Novel Protocol and Location Prediction Scheme Exploiting the "One For All" Framework for Location Management. 56-64 - Kiyoung Yang, Cyrus Shahabi:
A Multilevel Distance-Based Index Structure for Multivariate Time Series. 65-73 - Nicole Bidoit, Matthieu Objois:
Temporal Query Languages Expressive Power: µTL versus T-WHILE. 74-82 - Mohammed Al-Kateb, Essam Mansour, Mohamed E. El-Sharkawi:
CME: A Temporal Relational Model for Efficient Coalescing. 83-90 - Carlo Combi, Angelo Montanari, Rosalba Rossato:
A Uniform Algebraic Characterization of Temporal Functional Dependencies. 91-99
Temporal Logic in Computer Science
- Pieter H. Hartel:
A Trace Semantics for Positive Core XPath. 103-112 - Stéphane Demri, Ranko Lazic, David Nowak:
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. 113-121 - Andreas Schäfer:
Axiomatisation and Decidability of Multi-dimensional Duration Calculus. 122-130 - Roger Villemaire, Sylvain Hallé, Omar Cherkaoui:
Configuration Logic: A Multi-site Modal Logic. 131-137 - Carsten Lutz, Dirk Walther, Frank Wolter:
Quantitative Temporal Logics: PSPACE and Below. 138-146 - Alexei Lisitsa, Igor Potapov:
Temporal Logic with Predicate lambda-Abstraction. 147-155 - Marko Samer, Helmut Veith:
Deterministic CTL Query Solving. 156-165 - Ben D'Angelo, Sriram Sankaranarayanan, César Sánchez, Will Robinson, Bernd Finkbeiner, Henny B. Sipma, Sandeep Mehrotra, Zohar Manna:
LOLA: Runtime Monitoring of Synchronous Systems. 166-174
Posters
- André Trudel, Haiyi Zhang:
Exploiting the Relationship between IA Networks and Finite Domain CSPs. 177-179 - Seo-Young Noh, Shashi K. Gadia:
An XML-Based Framework for Temporal Database Implementation. 180-182 - Johann Eder, Horst Pichler:
Probabilistic Calculation of Execution Intervals for Workflows. 183-185 - Song Lin, Dimitrios Gunopulos, Vana Kalogeraki, Stefano Lonardi:
A Data Compression Technique for Sensor Networks with Dynamic Bandwidth Allocation. 186-188 - Volker Gruhn, Ralf Laue:
Specification Patterns for Time-Related Properties. 189-191 - Michel A. Reniers, Yaroslav S. Usenko:
Analysis of Timed Processes with Data Using Algebraic Transformations. 192-194 - Artie Basukoski, Alexander Bolotov:
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity. 195-197
Invited Posters
- Angelo Montanari:
Propositional Interval Temporal Logics: Some Promising Paths. 201-203 - Time in Liverpool - An Overview of Temporal Research in the Logic and Computation Group. 204-206
- Fusheng Wang, Carlo Zaniolo, Xin Zhou, Hyun Jin Moon:
Version Management and Historical Queries in Digital Libraries. 207-209 - Peter Z. Revesz:
Efficient Rectangle Indexing Algorithms Based on Point Dominance. 210-212
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.