The complexity of temporal logic over the reals

13 years 4 months ago

Download www.csse.uwa.edu.au

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 time temporal logic. Key words: temporal logic PACS:

M. Reynolds

Real-time Traffic

APAL 2010 | Temporal Logic | Temporal Logic Pacs | Time Temporal Logic |

claim paper

» Robust Satisfaction of Temporal Logic over RealValued Signals

» The complexity of lineartime temporal logic over the class of ordinals

» The Complexity of Temporal Logic with Until and Since over Ordinals

» On the decidability and complexity of Metric Temporal Logic over finite words

» Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models

» Expressiveness of Metric Modalities for Continuous Time

» On temporal logic constraint solving for analyzing numerical data time series

» Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	APAL
Authors	M. Reynolds

Comments (0)

Sciweavers

The complexity of temporal logic over the reals

APAL 2010 | Temporal Logic | Temporal Logic Pacs | Time Temporal Logic |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers