The Complexity of Generalized Satisfiability for Linear Temporal Logic. Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., & Vollmer, H. Electronic Colloquium on Computational Complexity (ECCC), 2006.
The Complexity of Generalized Satisfiability for Linear Temporal Logic [link]Paper  bibtex   
@article{DBLP:journals/eccc/BaulandSSSV06,
  author    = {Michael Bauland and
               Thomas Schneider and
               Henning Schnoor and
               Ilka Schnoor and
               Heribert Vollmer},
  title     = {The Complexity of Generalized Satisfiability for Linear Temporal Logic},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {153},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-153/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BaulandSSSV06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0