{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:32Z","timestamp":1725512432908},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713883"},{"type":"electronic","value":"9783540713890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71389-0_5","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T16:22:53Z","timestamp":1183306973000},"page":"48-62","source":"Crossref","is-referenced-by-count":6,"title":["The Complexity of Generalized Satisfiability for Linear Temporal Logic"],"prefix":"10.1007","author":[{"given":"Michael","family":"Bauland","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Schnoor","sequence":"additional","affiliation":[]},{"given":"Ilka","family":"Schnoor","sequence":"additional","affiliation":[]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/954092.954101","volume":"34","author":"E. B\u00f6hler","year":"2003","unstructured":"B\u00f6hler, E., et al.: Playing with Boolean blocks, part I: Post\u2019s lattice with applications to complexity theory. SIGACT News\u00a034(4), 38\u201352 (2003)","journal-title":"SIGACT News"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/11672142_41","volume-title":"STACS 2006","author":"M. Bauland","year":"2006","unstructured":"Bauland, M., et al.: Generalized modal satisfiability. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 500\u2013511. Springer, Heidelberg (2006)"},{"key":"5_CR3","unstructured":"Bauland, M., et al.: The complexity of generalized satisfiability for linear temporal logic. Technical Report TR06-153, Electronic Colloquium on Computational Complexity (2006)"},{"key":"5_CR4","first-page":"151","volume-title":"Proceedings 3rd Symposium on Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings 3rd Symposium on Theory of Computing, pp. 151\u2013158. ACM Press, New York (1971)"},{"key":"5_CR5","unstructured":"Dalmau, V.: Computational Complexity of Problems over Generalized Formulas. PhD thesis, Department de Llenguatges i Sistemes Inform\u00e0tica, Universitat Polit\u00e9cnica de Catalunya (2000)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01744287","volume":"13","author":"H. Lewis","year":"1979","unstructured":"Lewis, H.: Satisfiability problems for propositional calculi. Mathematical Systems Theory\u00a013, 45\u201353 (1979)","journal-title":"Mathematical Systems Theory"},{"key":"5_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-540-32275-7_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G. Nordh","year":"2005","unstructured":"Nordh, G.: A trichotomy in the complexity of propositional circumscription. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 257\u2013269. Springer, Heidelberg (2005)"},{"key":"5_CR8","volume-title":"Theories of Computability","author":"N. Pippenger","year":"1997","unstructured":"Pippenger, N.: Theories of Computability. Cambridge University Press, Cambridge (1997)"},{"key":"5_CR9","first-page":"46","volume-title":"FOCS","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46\u201357. IEEE Computer Society Press, Los Alamitos (1977)"},{"key":"5_CR10","first-page":"1","volume":"5","author":"E. Post","year":"1941","unstructured":"Post, E.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies\u00a05, 1\u2013122 (1941)","journal-title":"Annals of Mathematical Studies"},{"key":"5_CR11","unstructured":"Reith, S.: Generalized Satisfiability Problems. PhD thesis, Fachbereich Mathematik und Informatik, Universit\u00e4t W\u00fcrzburg (2001)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(03)00092-0","volume":"186","author":"S. Reith","year":"2003","unstructured":"Reith, S., Vollmer, H.: Optimal satisfiability for propositional calculi and constraint satisfaction problems. Information and Computation\u00a0186(1), 1\u201319 (2003)","journal-title":"Information and Computation"},{"key":"5_CR13","volume-title":"Proceedings International Conference Mathematical Foundation of Informatics, (MFI99)","author":"S. Reith","year":"2005","unstructured":"Reith, S., Wagner, K.W.: The complexity of problems defined by Boolean circuits. In: Proceedings International Conference Mathematical Foundation of Informatics (MFI99), World Scientific, Singapore (2005)"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. Sistla","year":"1985","unstructured":"Sistla, A., Clarke, E.: The complexity of propositional linear temporal logics. Journal of the ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"Journal of the ACM"},{"key":"5_CR15","unstructured":"Schnoor, H.: The complexity of the Boolean formula value problem. Technical report, Theoretical Computer Science, University of Hannover (2005)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"Stockmeyer, L.: The polynomial-time hierarchy. Theoretical Computer Science\u00a03, 1\u201322 (1977)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71389-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:19:40Z","timestamp":1605745180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71389-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540713883","9783540713890"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0_5","relation":{},"subject":[]}}