TY - GEN
T1 - Temporal logics over linear time domains are in PSPACE
AU - Rabinovich, Alexander
PY - 2010
Y1 - 2010
N2 - We investigate the complexity of the satisfiability problem of temporal logics with a finite set of modalities definable in the existential fragment of monadic second-order logic. We show that the problem is in pspace over the class of all linear orders. The same techniques show that the problem is in pspace over many interesting classes of linear orders.
AB - We investigate the complexity of the satisfiability problem of temporal logics with a finite set of modalities definable in the existential fragment of monadic second-order logic. We show that the problem is in pspace over the class of all linear orders. The same techniques show that the problem is in pspace over many interesting classes of linear orders.
UR - http://www.scopus.com/inward/record.url?scp=78049247986&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15349-5_3
DO - 10.1007/978-3-642-15349-5_3
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:78049247986
SN - 3642153488
SN - 9783642153488
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 29
EP - 50
BT - Reachability Problems - 4th International Workshop, RP 2010, Proceedings
T2 - 4th International Workshop on Reachability Problems, RP 2010
Y2 - 28 August 2010 through 29 August 2010
ER -