{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:51:56Z","timestamp":1773939116145,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642276590","type":"print"},{"value":"9783642276606","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_19","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T10:14:28Z","timestamp":1326708868000},"page":"226-237","source":"Crossref","is-referenced-by-count":14,"title":["Complexity of Model Checking for Modal Dependence Logic"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Ebbing","sequence":"first","affiliation":[]},{"given":"Peter","family":"Lohmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Beyersdorff, O., Meier, A., Mundhenk, M., Schneider, T., Thomas, M., Vollmer, H.: Model checking CTL is almost always inherently sequential. Logical Methods in Computer Science (2011), \n                      \n                        http:\/\/arxiv.org\/abs\/1103.4990v1","DOI":"10.2168\/LMCS-7(2:12)2011"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst.\u00a08(2), 244\u2013263 (1986)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"19_CR3","unstructured":"Ebbing, J., Lohmann, P.: Complexity of model checking for modal dependence logic. CoRR abs\/1104.1034v1 (2011), \n                      \n                        http:\/\/arxiv.org\/abs\/1104.1034v1"},{"key":"19_CR4","unstructured":"Hemaspaandra, E.: The complexity of poor man\u2019s logic. CoRR cs.LO\/9911014v2 (2005), \n                      \n                        http:\/\/arxiv.org\/abs\/cs\/9911014v2"},{"issue":"7","key":"19_CR5","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.jcss.2009.10.011","volume":"76","author":"E. Hemaspaandra","year":"2010","unstructured":"Hemaspaandra, E., Schnoor, H., Schnoor, I.: Generalized modal satisfiability. J. Comput. Syst. Sci.\u00a076(7), 561\u2013578 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_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":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-15205-4_32","volume-title":"Computer Science Logic","author":"P. Lohmann","year":"2010","unstructured":"Lohmann, P., Vollmer, H.: Complexity Results for Modal Dependence Logic. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 411\u2013425. Springer, Heidelberg (2010), \n                      \n                        http:\/\/dx.doi.org\/10.1007\/978-3-642-15205-4_32"},{"issue":"6","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1093\/logcom\/exn102","volume":"19","author":"M. Sevenster","year":"2009","unstructured":"Sevenster, M.: Model-theoretic and computational properties of modal dependence logic. Journal of Logic and Computation\u00a019(6), 1157\u20131173 (2009), \n                      \n                        http:\/\/logcom.oxfordjournals.org\/cgi\/content\/abstract\/exn102v1","journal-title":"Journal of Logic and Computation"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Dependence logic: A new approach to independence friendly logic. London Mathematical Society Student Texts, vol.\u00a070. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511611193"},{"key":"19_CR10","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Modal dependence logic. In: Apt, K.R., van Rooij, R. (eds.) New Perspectives on Games and Interaction, Texts in Logic and Games, vol.\u00a04, pp. 237\u2013254. Amsterdam University Press (2008)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:35:18Z","timestamp":1558298118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}