{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:59:56Z","timestamp":1740095996035,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152047"},{"type":"electronic","value":"9783642152054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15205-4_32","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T14:48:24Z","timestamp":1281710904000},"page":"411-425","source":"Crossref","is-referenced-by-count":8,"title":["Complexity Results for Modal Dependence Logic"],"prefix":"10.1007","author":[{"given":"Peter","family":"Lohmann","sequence":"first","affiliation":[]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11229-008-9415-6","volume":"167","author":"S. Abramsky","year":"2009","unstructured":"Abramsky, S., V\u00e4\u00e4n\u00e4nen, J.: From IF to BI. Synthese\u00a0167(2), 207\u2013230 (2009)","journal-title":"Synthese"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Bauland, M., B\u00f6hler, E., Creignou, N., Reith, S., Schnoor, H., Vollmer, H.: The complexity of problems for quantified constraints. Theory of Computing Systems (to appear), http:\/\/dx.doi.org\/10.1007\/s00224-009-9194-6","DOI":"10.1007\/s00224-009-9194-6"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bauland, M., Hemaspaandra, E., Schnoor, H., Schnoor, I.: Generalized modal satisfiability. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 500\u2013511. Springer, Heidelberg (2006), revised version: [7]","DOI":"10.1007\/11672142_41"},{"issue":"2-3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0004-3702(92)90076-A","volume":"53","author":"F.M. Donini","year":"1992","unstructured":"Donini, F.M., Lenzerini, M., Nardi, D., Hollunder, B., Nutt, W., Marchetti-Spaccamela, A.: The complexity of existential quantification in concept languages. Artif. Intell.\u00a053(2-3), 309\u2013327 (1992)","journal-title":"Artif. Intell."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, E.: The complexity of poor man\u2019s logic. Journal of Logic and Computation\u00a011(4), 609\u2013622 (2001); corrected version: [6]","DOI":"10.1093\/logcom\/11.4.609"},{"key":"32_CR6","unstructured":"Hemaspaandra, E.: The complexity of poor man\u2019s logic. CoRR cs.LO\/9911014v2 (2005), http:\/\/arxiv.org\/abs\/cs\/9911014v2"},{"key":"32_CR7","unstructured":"Hemaspaandra, E., Schnoor, H., Schnoor, I.: Generalized modal satisability. CoRR abs\/0804.2729 (2008), http:\/\/arxiv.org\/abs\/0804.2729"},{"key":"32_CR8","first-page":"167","volume-title":"Proceedings Symposium Foundations of Mathematics, Infinitistic Methods","author":"L. Henkin","year":"1961","unstructured":"Henkin, L.: Some remarks on infinitely long formulas. In: Proceedings Symposium Foundations of Mathematics, Infinitistic Methods, pp. 167\u2013183. Pergamon, Warsaw (1961)"},{"key":"32_CR9","first-page":"571","volume-title":"Logic, Methodology and Philosophy of Science","author":"J. Hintikka","year":"1989","unstructured":"Hintikka, J., Sandu, G.: Informational independence as a semantical phenomenon. In: Fenstad, J.E., Frolov, I.T., Hilpinen, R. (eds.) Logic, Methodology and Philosophy of Science, vol.\u00a08, pp. 571\u2013589. Elsevier, Amsterdam (1989)"},{"issue":"3","key":"32_CR10","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 Journal on Computing\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR11","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":"#cr-split#-32_CR12.1","doi-asserted-by":"crossref","unstructured":"Meier, A., Mundhenk, M., Thomas, M., Vollmer, H.: The complexity of satisfiability for fragments of CTL and CTL?????????. Electronic Notes in Theoretical Computer Science, vol.??223, pp. 201???213 (2008), http:\/\/www.sciencedirect.com\/science\/article\/B75H1-4V74F2X-H\/2\/c7a568c03e20ed2064b112167445414d;","DOI":"10.1016\/j.entcs.2008.12.040"},{"key":"#cr-split#-32_CR12.2","unstructured":"Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Peterson, G., Reif, J., Azhar, S.: Lower bounds for multiplayer noncooperative games of incomplete information. Computers & Mathematics with Applications\u00a041(7-8), 957\u2013992 (2001), http:\/\/www.sciencedirect.com\/science\/article\/B6TYJ-43P387P-19\/2\/cd72ba7ccb5f3c2a2b65eb3c45aa2ca7","DOI":"10.1016\/S0898-1221(00)00333-3"},{"key":"32_CR14","unstructured":"Reith, S., Wagner, K.W.: The complexity of problems defined by boolean circuits. In: Proceedings International Conference Mathematical Foundation of Informatics (MFI 1999), pp. 25\u201328. World Science Publishing (2000)"},{"issue":"6","key":"32_CR15","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), http:\/\/logcom.oxfordjournals.org\/cgi\/content\/abstract\/exn102v1","journal-title":"Journal of Logic and Computation"},{"key":"32_CR16","series-title":"London Mathematical Society student texts","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511611193","volume-title":"Dependence logic: A new approach to independence friendly logic","author":"J. V\u00e4\u00e4n\u00e4nen","year":"2007","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, Cambridge (2007)"},{"key":"32_CR17","first-page":"237","volume-title":"New Perspectives on Games and Interaction, Texts in Logic and Games","author":"J. V\u00e4\u00e4n\u00e4nen","year":"2008","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, Amsterdam (2008)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15205-4_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:32Z","timestamp":1606186952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15205-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152047","9783642152054"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15205-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}