Sciweavers

1466 search results - page 5 / 294
» Complexity of Reasoning over Temporal Data Models
Sort
View
TIME
2003
IEEE
15 years 2 months ago
A Novel Approach to Model NOW in Temporal Databases
In bitemporal databases, current facts and transaction states are modelled using a special value to represent the current time (such as a minimum or maximum timestamp or NULL). Pr...
Bela Stantic, John Thornton, Abdul Sattar
ICLP
1997
Springer
15 years 1 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
74
Voted
DLOG
2008
14 years 12 months ago
Decidable Reasoning over Timestamped Conceptual Models
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...
Alessandro Artale, David Toman
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 9 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
CORR
2007
Springer
135views Education» more  CORR 2007»
14 years 9 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell