{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:39:37Z","timestamp":1725745177247},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642399916"},{"type":"electronic","value":"9783642399923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39992-3_21","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T10:08:18Z","timestamp":1376474898000},"page":"238-250","source":"Crossref","is-referenced-by-count":3,"title":["Model Checking for Modal Dependence Logic: An Approach through Post\u2019s Lattice"],"prefix":"10.1007","author":[{"given":"Julian-Steffen","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1877714.1877719","volume":"12","author":"M. Bauland","year":"2011","unstructured":"Bauland, M., Mundhenk, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log.\u00a012(2), 26 (2011)","journal-title":"ACM Trans. Comput. Log."},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/954092.954101","volume":"34","author":"E. B\u00f6hler","year":"2003","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., Vollmer, H.: 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":"21_CR3","doi-asserted-by":"crossref","unstructured":"Buss, S.R.: The boolean formula value problem is in alogtime. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 123\u2013131 (1987)","DOI":"10.1145\/28395.28409"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-27660-6_19","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"J. Ebbing","year":"2012","unstructured":"Ebbing, J., Lohmann, P.: Complexity of model checking for modal dependence logic. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol.\u00a07147, pp. 226\u2013237. Springer, Heidelberg (2012)"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences\u00a018(2), 194\u2013211 (1979)","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"7","key":"21_CR6","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."},{"issue":"3","key":"21_CR7","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":"21_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01744287","volume":"13","author":"H.R. Lewis","year":"1979","unstructured":"Lewis, H.R.: Satisfiability problems for propositional calculi. Mathematical Systems Theory\u00a013, 45\u201353 (1979)","journal-title":"Mathematical Systems Theory"},{"key":"21_CR9","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)"},{"key":"21_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"},{"issue":"6","key":"21_CR11","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"},{"issue":"10","key":"21_CR12","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.ipl.2012.02.002","volume":"112","author":"M. Thomas","year":"2012","unstructured":"Thomas, M.: On the applicability of Post\u2019s lattice. Inf. Process. Lett.\u00a0112(10), 386\u2013391 (2012)","journal-title":"Inf. Process. Lett."},{"key":"21_CR13","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","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39992-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:45:42Z","timestamp":1558021542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39992-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399916","9783642399923"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39992-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}