18 search results - page 1 / 4 » The Complexity of Temporal Logic with Until and Since over O... |
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. 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 thanks to ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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...
APAL
2010
13 years 7 months ago
2010
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense ...
SEBD
2001
13 years 9 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...