The Complexity of Generalized Satisfiability for Linear Temporal Logic. Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., & Vollmer, H. In Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings, pages 48–62, 2007.
The Complexity of Generalized Satisfiability for Linear Temporal Logic [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/fossacs/BaulandSSSV07,
  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},
  booktitle = {Foundations of Software Science and Computational Structures, 10th
               International Conference, {FOSSACS} 2007, Held as Part of the Joint
               European Conferences on Theory and Practice of Software, {ETAPS} 2007,
               Braga, Portugal, March 24-April 1, 2007, Proceedings},
  pages     = {48--62},
  year      = {2007},
  crossref  = {DBLP:conf/fossacs/2007},
  url       = {https://doi.org/10.1007/978-3-540-71389-0\_5},
  doi       = {10.1007/978-3-540-71389-0\_5},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fossacs/BaulandSSSV07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0