Sciweavers

TIME
2005
IEEE
13 years 9 months ago
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
Artie Basukoski, Alexander Bolotov
TIME
2005
IEEE
13 years 9 months ago
LOLA: Runtime Monitoring of Synchronous Systems
Abstract— We present a specification language and algorithms for the online and offline monitoring of synchronous systems including circuits and embedded systems. Such monitori...
Ben D'Angelo, Sriram Sankaranarayanan, Césa...
TIME
2006
IEEE
13 years 9 months ago
From Language to Time: A Temporal Expression Anchorer
Benjamin Han, Donna Gates, Lori S. Levin
TIME
2006
IEEE
13 years 9 months ago
Temporal Arithmetic Mixing Months and Days
In this paper, we present our work on creating a complete set of rules for temporal arithmetic mixing months and days based on the “history-dependent intuition”. Many examples...
Feng Pan, Jerry R. Hobbs
TIME
2006
IEEE
13 years 9 months ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov
TIME
2006
IEEE
13 years 9 months ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...
TIME
2006
IEEE
13 years 9 months ago
How Would You Like to Aggregate Your Temporal Data?
Published in: Proceedings of the 13th International Symposium on Temporal Representation and Reasoning (TIME-06), Budapest, Hungary, June 2006. IEEE Computer Society Press. Real-w...
Michael H. Böhlen, Johann Gamper, Christian S...
TIME
2006
IEEE
13 years 9 months ago
k-Anonymity in Databases with Timestamped Data
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
Sergio Mascetti, Claudio Bettini, Xiaoyang Sean Wa...
TIME
2006
IEEE
13 years 9 months ago
DyST: Dynamic and Scalable Temporal Text Indexing
An increasing number of documents in companies and other organizations are now only available electronically, and exist in several versions updated at different times. In order to...
Kjetil Nørvåg, Albert Overskeid Nyb&o...