{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T07:10:20Z","timestamp":1712560220247},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T00:00:00Z","timestamp":1311638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00453-011-9552-z","type":"journal-article","created":{"date-parts":[[2011,7,25]],"date-time":"2011-07-25T15:43:05Z","timestamp":1311608585000},"page":"38-55","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized Modal Satisfiability"],"prefix":"10.1007","volume":"64","author":[{"given":"Antonis","family":"Achilleos","sequence":"first","affiliation":[]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[]},{"given":"Valia","family":"Mitsou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,26]]},"reference":[{"key":"9552_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, New York (2006)"},{"key":"9552_CR2","first-page":"71","volume-title":"Advances in Modal Logic","author":"A.V. Chagrov","year":"2002","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, London (2002)"},{"issue":"1","key":"9552_CR3","doi-asserted-by":"crossref","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. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"9552_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, Berlin (1999)"},{"key":"9552_CR5","volume-title":"Reasoning About Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)"},{"key":"9552_CR6","volume-title":"Logic and Automata: History and Perspectives","author":"J. Flum","year":"2008","unstructured":"Flum, J., Gr\u00e4del, E., Wilke, T.: Logic and Automata: History and Perspectives. Amsterdam Univ Press, Amsterdam (2008)"},{"key":"9552_CR7","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York (2006)"},{"issue":"1\u20133","key":"9552_CR8","doi-asserted-by":"crossref","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. Log. 130(1\u20133), 3\u201331 (2004)","journal-title":"Ann. Pure Appl. Log."},{"key":"9552_CR9","volume":"14","author":"M. Grohe","year":"2007","unstructured":"Grohe, M.: Logic, graphs, and algorithms. Electron. Colloq. Comput. Complex. 14, 091 (2007)","journal-title":"Electron. Colloq. Comput. Complex."},{"issue":"2","key":"9552_CR10","doi-asserted-by":"crossref","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. 75(2), 361\u2013372 (1995)","journal-title":"Artif. Intell."},{"issue":"3","key":"9552_CR11","doi-asserted-by":"crossref","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. 54(3), 319\u2013379 (1992)","journal-title":"Artif. Intell."},{"issue":"4","key":"9552_CR12","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1093\/logcom\/exm029","volume":"17","author":"J.Y. Halpern","year":"2007","unstructured":"Halpern, J.Y.: L.C. R\u00eago. Characterizing the NP-PSPACE gap in the satisfiability problem for modal logic. J. Log. Comput. 17(4), 795 (2007)","journal-title":"J. Log. Comput."},{"issue":"3","key":"9552_CR13","doi-asserted-by":"crossref","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. 6(3), 467\u2013480 (1977)","journal-title":"SIAM J. Comput."},{"key":"9552_CR14","first-page":"249","volume":"5","author":"L.A. Nguyen","year":"2005","unstructured":"Nguyen, L.A.: On the complexity of fragments of modal logics. Adv. Modal Logic 5, 249\u2013268 (2005)","journal-title":"Adv. Modal Logic"},{"key":"9552_CR15","unstructured":"Spaan, E.: Complexity of modal logics. PhD thesis, University of Amsterdam (1993)"},{"key":"9552_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization-Eureka, You Shrink!","author":"G. Woeginger","year":"2003","unstructured":"Woeginger, G.: Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization-Eureka, You Shrink! Lecture Notes in Computer Science, vol. 2570, pp. 185\u2013207. Springer, Berlin (2003)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9552-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9552-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9552-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:08Z","timestamp":1559137508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9552-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,26]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9552"],"URL":"http:\/\/dx.doi.org\/10.1007\/s00453-011-9552-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,26]]}}}
