A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Quantitative Temporal Logics: PSPACE and Below
12th International Symposium on Temporal Representation and Reasoning (TIME'05)
Often, the addition of metric operators to qualitative temporal logics leads to an increase of the complexity of satisfiability by at least one exponential. In this paper, we exhibit a number of metric extensions of qualitative temporal logics of the real line that do not lead to an increase in computational complexity. We show that the language obtained by extending since/until logic of the real line with the operators 'sometime within n time units', n coded in binary, is PSPACE-complete evendoi:10.1109/time.2005.31 dblp:conf/time/LutzWW05 fatcat:yey2vpohqzfnthf55bmdbgteue