The Complexity of Generalized Satisfiability for Linear Temporal Logic. Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., & Vollmer, H. Electron. Colloquium Comput. Complex., 2006.
The Complexity of Generalized Satisfiability for Linear Temporal Logic. [link]Link  The Complexity of Generalized Satisfiability for Linear Temporal Logic. [link]Paper  bibtex   
@article{journals/eccc/BaulandSSSV06,
  added-at = {2020-09-08T00:00:00.000+0200},
  author = {Bauland, Michael and Schneider, Thomas and Schnoor, Henning and Schnoor, Ilka and Vollmer, Heribert},
  biburl = {https://www.bibsonomy.org/bibtex/24d9bb69400b2674e217994121dd451bf/dblp},
  ee = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-153/index.html},
  interhash = {d0957cfbef559696c6d7f439e14684a5},
  intrahash = {4d9bb69400b2674e217994121dd451bf},
  journal = {Electron. Colloquium Comput. Complex.},
  keywords = {dblp},
  number = 153,
  timestamp = {2020-09-09T12:32:35.000+0200},
  title = {The Complexity of Generalized Satisfiability for Linear Temporal Logic.},
  url = {http://dblp.uni-trier.de/db/journals/eccc/eccc13.html#BaulandSSSV06},
  volume = 13,
  year = 2006
}

Downloads: 0