The Complexity of Generalized Satisfiability for Linear Temporal Logic

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electronic Colloquium on Computational Complexity (ECCC), 13(153), 2006. [doi]

Abstract

Abstract is missing.