{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:38:57Z","timestamp":1742949537923,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030930998"},{"type":"electronic","value":"9783030931001"}],"license":[{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93100-1_9","type":"book-chapter","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T23:02:26Z","timestamp":1639609346000},"page":"125-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Parameterized View on the Complexity of Dependence Logic"],"prefix":"10.1007","author":[{"given":"Juha","family":"Kontinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasir","family":"Mahmood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/0608024","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Algebraic Discrete Meth. (1987). https:\/\/doi.org\/10.1137\/0608024","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"9_CR2","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern., 11(1\u20132), 1\u201321 (1993). https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/view\/3417"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: SOFSEM, vol. 3381 of Lecture Notes in Computer Science, pp. 1\u201316. Springer (2005). https:\/\/doi.org\/10.1007\/978-3-540-30577-4_1","DOI":"10.1007\/978-3-540-30577-4_1"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2362355.2362359","volume":"13","author":"A Durand","year":"2012","unstructured":"Durand, A., Kontinen, J.: Hierarchies in dependence logic. ACM Trans. Comput. Logic (TOCL) 13(4), 31 (2012). https:\/\/doi.org\/10.1145\/2362355.2362359","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite model theory. In: Perspectives in Mathematical Logic. Springer (1995). 978-3-540-60149-4, https:\/\/doi.org\/10.1007\/978-3-662-03182-7","DOI":"10.1007\/978-3-662-03182-7"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s00453-014-9944-y","volume":"71","author":"M Elberfeld","year":"2014","unstructured":"Elberfeld, M., Stockhusen, C., Tantau, T.: On the space and circuit complexity of parameterized problems: classes and completeness. Algorithmica 71(3), 661\u2013701 (2014). https:\/\/doi.org\/10.1007\/s00453-014-9944-y","journal-title":"Algorithmica"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Parameterized Complexity Theory. TTCSAES. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.apal.2011.08.005","volume":"163","author":"P Galliani","year":"2012","unstructured":"Galliani, P.: Inclusion and exclusion dependencies in team semantics: on some logics of imperfect information. Ann. Pure Appl. Logic 163(1), 68\u201384 (2012). https:\/\/doi.org\/10.1016\/j.apal.2011.08.005","journal-title":"Ann. Pure Appl. Logic"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Galliani, P.: On strongly first-order dependencies. In: Dependence Logic, pp. 53\u201371. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-31803-5_4","DOI":"10.1007\/978-3-319-31803-5_4"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Galliani, P., Hella, L.: Inclusion logic and fixed point logic. In: Rocca, S.R.D. (ed.) Computer science logic 2013 (CSL 2013), vol. 23 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 281\u2013295, Dagstuhl, Germany, 2013. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2013.281","DOI":"10.4230\/LIPIcs.CSL.2013.281"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2012.10.033","volume":"493","author":"E Gr\u00e4del","year":"2013","unstructured":"Gr\u00e4del, E.: Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493, 2\u201314 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.10.033","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s11225-013-9479-2","volume":"101","author":"E Gr\u00e4del","year":"2013","unstructured":"Gr\u00e4del, E., V\u00e4\u00e4n\u00e4nen, J.: Dependence and independence. Studia Logica 101(2), 399\u2013410 (2013). https:\/\/doi.org\/10.1007\/s11225-013-9479-2","journal-title":"Studia Logica"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Hannula, M., Kontinen, J., Bussche, J.V., Virtema, J.: Descriptive complexity of real computation and probabilistic independence logic. In: LICS, pp. 550\u2013563. ACM (2020). https:\/\/doi.org\/10.1145\/3373718.3394773","DOI":"10.1145\/3373718.3394773"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Hannula, M., Kontinen, J., Virtema, J., Vollmer, H.: Complexity of propositional logics in team semantic. ACM Trans. Comput. Log. 19(1), 2:1\u20132:14 (2018). https:\/\/doi.org\/10.1145\/3157054","DOI":"10.1145\/3157054"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s11225-013-9481-8","volume":"101","author":"J Kontinen","year":"2013","unstructured":"Kontinen, J.: Coherence and computational complexity of quantifier-free dependence logic formulas. Studia Logica 101(2), 267\u2013291 (2013). https:\/\/doi.org\/10.1007\/s11225-013-9481-8","journal-title":"Studia Logica"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Libkin, L.: Elements of finite model theory. In: Texts in Theoretical Computer Science. An EATCS Series. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-662-07003-1","DOI":"10.1007\/978-3-662-07003-1"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11225-013-9483-6","volume":"101","author":"P Lohmann","year":"2013","unstructured":"Lohmann, P., Vollmer, H.: Complexity results for modal dependence logic. Stud. Logica 101(2), 343\u2013366 (2013). https:\/\/doi.org\/10.1007\/s11225-013-9483-6","journal-title":"Stud. Logica"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"L\u00fcck, M.: Canonical models and the complexity of modal team logic. Log. Methods Comput. Sci. 15(2) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(2:2)2019","DOI":"10.23638\/LMCS-15(2:2)2019"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Mahmood, Y., Meier, A.: Parameterised complexity of model checking and satisfiability in propositional dependence logic. In: Foundations of Information and Knowledge Systems - 11th International Symposium, FoIKS 2020, 17\u201321 February 2020, Dortmund, Germany, Proceedings, pp. 157\u2013174 (2020). https:\/\/doi.org\/10.1007\/978-3-030-39951-1_10","DOI":"10.1007\/978-3-030-39951-1_10"},{"key":"9_CR21","unstructured":"Mahmood, Y., Virtema, J.: Parameterised complexity of propositional logic in team semantics. CoRR. arXiv: 2105.14887"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Martin, B.: First-order model checking problems parameterized by the model. In: CiE, volume 5028 of Lecture Notes in Computer Science, pp. 417\u2013427. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-69407-6_45","DOI":"10.1007\/978-3-540-69407-6_45"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Meier, A., Reinbold, C.: Enumeration complexity of poor man\u2019s propositional dependence logic. In: FoIKS, volume 10833 of Lecture Notes in Computer Science, pp. 303\u2013321. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-90050-6_17","DOI":"10.1007\/978-3-319-90050-6_17"},{"key":"9_CR24","unstructured":"Papadimitriou, C.H.: Computational Complexity (1994). 978-0-201-53082-7 25"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984). https:\/\/doi.org\/10.1016\/0095-8956(84)90013-3","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Samer, M., Szeider, S.: Fixed-parameter tractability. In: Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, pp. 425\u2013454. IOS Press (2009). https:\/\/doi.org\/10.3233\/978-1-58603-929-5-425","DOI":"10.3233\/978-1-58603-929-5-425"},{"key":"9_CR27","unstructured":"V\u00e4\u00e4n\u00e4nen, J.A.: Dependence Logic - A New Approach to Independence Friendly Logic, volume 70 of London Mathematical Society student texts. Cambridge University Press (2007). 978-0-521-70015-3"},{"key":"9_CR28","unstructured":"Virtema, J.: Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity. PhD thesis, School of Information Sciences of the University of Tampere (2014). 978-951-44-9472-7"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93100-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T00:03:36Z","timestamp":1640563416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93100-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,16]]},"ISBN":["9783030930998","9783030931001"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93100-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021,12,16]]},"assertion":[{"value":"16 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}