TY - JOUR
T1 - Temporal logics over linear time domains are in PSPACE
AU - Rabinovich, Alexander
PY - 2012/1
Y1 - 2012/1
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=82355162896&partnerID=8YFLogxK
U2 - 10.1016/j.ic.2011.11.002
DO - 10.1016/j.ic.2011.11.002
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:82355162896
SN - 0890-5401
VL - 210
SP - 40
EP - 67
JO - Information and Computation
JF - Information and Computation
ER -