The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract)

Stéphane Demri, Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). In Michel Morvan, Christoph Meinel, Daniel Krob, editors, STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings. Volume 1373 of Lecture Notes in Computer Science, pages 61-72, Springer, 1998.

Abstract

Abstract is missing.