Details
| Original language | English |
|---|---|
| Article number | 1 |
| Journal | Log. Methods Comput. Sci. |
| Volume | 5 |
| Issue number | 1 |
| Publication status | Published - 2009 |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Log. Methods Comput. Sci., Vol. 5, No. 1, 1, 2009.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - The Complexity of Generalized Satisfiability for Linear Temporal Logic
AU - Bauland, Michael
AU - Schneider, Thomas
AU - Schnoor, Henning
AU - Schnoor, Ilka
AU - Vollmer, Heribert
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2009
Y1 - 2009
M3 - Article
VL - 5
JO - Log. Methods Comput. Sci.
JF - Log. Methods Comput. Sci.
IS - 1
M1 - 1
ER -