{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:31:51Z","timestamp":1794378711446,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141614","type":"print"},{"value":"9783642141621","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_31","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:26:21Z","timestamp":1278307581000},"page":"369-380","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Modal Satisfiability"],"prefix":"10.1007","author":[{"given":"Antonis","family":"Achilleos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valia","family":"Mitsou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Studies in Logic and Practical Reasoning","volume-title":"Handbook of Modal Logic","author":"P. Blackburn","year":"2006","unstructured":"Blackburn, P., van Benthem, J.F.A.K., Wolter, F.: Handbook of Modal Logic. Studies in Logic and Practical Reasoning, vol.\u00a03. Elsevier Science Inc., New York (2006)"},{"key":"31_CR2","unstructured":"Chagrov, A.V., Rybakov, M.N.: How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics. In: Balbiani, P., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M. (eds.) Advances in Modal Logic, pp. 71\u201382. King\u2019s College Publications (2002)"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Inf. Comput.\u00a085(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"31_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)"},{"key":"31_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning About Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. The MIT Press, Cambridge (1995)"},{"key":"31_CR6","volume-title":"Parameterized complexity theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer, New York (2006)"},{"issue":"1-3","key":"31_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","volume":"130","author":"M. Frick","year":"2004","unstructured":"Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic\u00a0130(1-3), 3\u201331 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"31_CR8","unstructured":"Grohe, M.: Logic, graphs, and algorithms. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a014(091) (2007)"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0004-3702(95)00018-A","volume":"75","author":"J.Y. Halpern","year":"1995","unstructured":"Halpern, J.Y.: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artif. Intell.\u00a075(2), 361\u2013372 (1995)","journal-title":"Artif. Intell."},{"issue":"3","key":"31_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J.Y. Halpern","year":"1992","unstructured":"Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell.\u00a054(3), 319\u2013379 (1992)","journal-title":"Artif. Intell."},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R.E. Ladner","year":"1977","unstructured":"Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput.\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM J. Comput."},{"key":"31_CR12","first-page":"249","volume":"5","author":"L.A. Nguyen","year":"2005","unstructured":"Nguyen, L.A.: On the complexity of fragments of modal logics. Advances in Modal Logic\u00a05, 249\u2013268 (2005)","journal-title":"Advances in Modal Logic"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Woeginger, G.: Exact algorithms for NP-hard problems: A survey. Combinatorial Optimization\u2013Eureka, You Shrink!, 185\u2013207","DOI":"10.1007\/3-540-36478-1_17"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T11:26:30Z","timestamp":1740223590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_31","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}