{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:57:47Z","timestamp":1742986667228,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031397837"},{"type":"electronic","value":"9783031397844"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-39784-4_17","type":"book-chapter","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T22:02:07Z","timestamp":1693260127000},"page":"274-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of\u00a0Propositional Inclusion and\u00a0Independence Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5651-5391","authenticated-orcid":false,"given":"Yasir","family":"Mahmood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1582-3718","authenticated-orcid":false,"given":"Jonni","family":"Virtema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"issue":"9","key":"17_CR1","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.apal.2019.04.004","volume":"170","author":"J Corander","year":"2019","unstructured":"Corander, J., Hyttinen, A., Kontinen, J., Pensar, J., V\u00e4\u00e4n\u00e4nen, J.: A logical approach to context-specific independence. Ann. Pure Appl. Logic 170(9), 975\u2013992 (2019). https:\/\/doi.org\/10.1016\/j.apal.2019.04.004","journal-title":"Ann. Pure Appl. Logic"},{"key":"17_CR2","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"3\u20134","key":"17_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10472-017-9568-4","volume":"83","author":"A Durand","year":"2018","unstructured":"Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3\u20134), 297\u2013320 (2018). https:\/\/doi.org\/10.1007\/s10472-017-9568-4","journal-title":"Ann. Math. Artif. Intell."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-90050-6_11","volume-title":"Foundations of Information and Knowledge Systems","author":"A Durand","year":"2018","unstructured":"Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Probabilistic team semantics. In: Ferrarotti, F., Woltran, S. (eds.) FoIKS 2018. LNCS, vol. 10833, pp. 186\u2013206. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90050-6_11"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-39992-3_13","volume-title":"Logic, Language, Information, and Computation","author":"J Ebbing","year":"2013","unstructured":"Ebbing, J., Hella, L., Meier, A., M\u00fcller, J.-S., Virtema, J., Vollmer, H.: Extended modal dependence logic $$\\cal{EMDL}$$. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol. 8071, pp. 126\u2013137. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39992-3_13"},{"key":"17_CR6","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. 7147, pp. 226\u2013237. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27660-6_19"},{"key":"17_CR7","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. TTCSAES, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"1","key":"17_CR8","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":"17_CR9","doi-asserted-by":"publisher","unstructured":"Hannula, M., Kontinen, J., Van\u00a0den Bussche, J., Virtema, J.: Descriptive complexity of real computation and probabilistic independence logic. In: LICS 2020, pp. 550\u2013563. ACM (2020). https:\/\/doi.org\/10.1145\/3373718.3394773","DOI":"10.1145\/3373718.3394773"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Hannula, M., Kontinen, J., L\u00fcck, M., Virtema, J.: On quantified propositional logics and the exponential time hierarchy. In: GandALF. EPTCS, vol. 226, pp. 198\u2013212 (2016)","DOI":"10.4204\/EPTCS.226.14"},{"issue":"8","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1093\/logcom\/exaa048","volume":"30","author":"M Hannula","year":"2020","unstructured":"Hannula, M., Kontinen, J., Virtema, J.: Polyteam semantics. J. Log. Comput. 30(8), 1541\u20131566 (2020). https:\/\/doi.org\/10.1093\/logcom\/exaa048","journal-title":"J. Log. Comput."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-662-48057-1_21","volume-title":"Mathematical Foundations of Computer Science 2015","author":"M Hannula","year":"2015","unstructured":"Hannula, M., Kontinen, J., Virtema, J., Vollmer, H.: Complexity of propositional independence and inclusion logic. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 269\u2013280. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_21"},{"key":"17_CR13","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":"5","key":"17_CR14","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1093\/logcom\/exz008","volume":"29","author":"L Hella","year":"2019","unstructured":"Hella, L., Kuusisto, A., Meier, A., Virtema, J.: Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. 29(5), 605\u2013630 (2019). https:\/\/doi.org\/10.1093\/logcom\/exz008","journal-title":"J. Log. Comput."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Hella, L., Stumpf, J.: The expressive power of modal logic with inclusion atoms. In: Proceedings of the 6th GandALF, pp. 129\u2013143 (2015)","DOI":"10.4204\/EPTCS.193.10"},{"issue":"5\u20136","key":"17_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00153-017-0535-x","volume":"56","author":"T Hyttinen","year":"2017","unstructured":"Hyttinen, T., Paolini, G., V\u00e4\u00e4n\u00e4nen, J.: A logic for arguing about probabilities in measure teams. Arch. Math. Logic 56(5\u20136), 475\u2013489 (2017). https:\/\/doi.org\/10.1007\/s00153-017-0535-x","journal-title":"Arch. Math. Logic"},{"key":"17_CR17","unstructured":"Kontinen, J., Mahmood, Y., Meier, A., Vollmer, H.: Parameterized complexity of weighted team definability (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.00541"},{"issue":"8","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1093\/logcom\/exac070","volume":"32","author":"J Kontinen","year":"2022","unstructured":"Kontinen, J., Meier, A., Mahmood, Y.: A parameterized view on the complexity of dependence and independence logic. J. Log. Comput. 32(8), 1624\u20131644 (2022). https:\/\/doi.org\/10.1093\/logcom\/exac070","journal-title":"J. Log. Comput."},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Krebs, A., Meier, A., Virtema, J.: A team based variant of CTL. In: TIME 2015, pp. 140\u2013149 (2015). https:\/\/doi.org\/10.1109\/TIME.2015.11","DOI":"10.1109\/TIME.2015.11"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Krebs, A., Meier, A., Virtema, J., Zimmermann, M.: Team semantics for the specification and verification of hyperproperties. In: MFCS 2018, vol. 117, pp. 10:1\u201310:16. Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.10","DOI":"10.4230\/LIPIcs.MFCS.2018.10"},{"issue":"2","key":"17_CR21","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"},{"issue":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10472-021-09730-w","volume":"90","author":"Y Mahmood","year":"2021","unstructured":"Mahmood, Y., Meier, A.: Parameterised complexity of model checking and satisfiability in propositional dependence logic. Ann. Math. Artif. Intell. 90(2), 271\u2013296 (2021). https:\/\/doi.org\/10.1007\/s10472-021-09730-w","journal-title":"Ann. Math. Artif. Intell."},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-90050-6_17","volume-title":"Foundations of Information and Knowledge Systems","author":"A Meier","year":"2018","unstructured":"Meier, A., Reinbold, C.: Enumeration complexity of poor man\u2019s propositional dependence logic. In: Ferrarotti, F., Woltran, S. (eds.) FoIKS 2018. LNCS, vol. 10833, pp. 303\u2013321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90050-6_17"},{"issue":"7","key":"17_CR24","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/S0898-1221(00)00333-3","volume":"41","author":"G Peterson","year":"2001","unstructured":"Peterson, G., Reif, J., Azhar, S.: Lower bounds for multiplayer noncooperative games of incomplete information. Comput. Math. Appl. 41(7), 957\u2013992 (2001)","journal-title":"Comput. Math. Appl."},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Peterson, G.L., Reif, J.H.: Multiple-person alternation, pp. 348\u2013363. IEEE Computer Society (1979). https:\/\/doi.org\/10.1109\/SFCS.1979.25","DOI":"10.1109\/SFCS.1979.25"},{"key":"17_CR26","volume-title":"Theories of Computability","author":"N Pippenger","year":"1997","unstructured":"Pippenger, N.: Theories of Computability. Cambridge University Press, Cambridge (1997)"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Shukla, A., Biere, A., Pulina, L., Seidl, M.: A survey on applications of quantified Boolean formulas. In: ICTAI 2019 (2019). https:\/\/doi.org\/10.1109\/ICTAI.2019.00020","DOI":"10.1109\/ICTAI.2019.00020"},{"key":"17_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511611193","volume-title":"Dependence Logic","author":"J V\u00e4\u00e4n\u00e4nen","year":"2007","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Dependence Logic. Cambridge University Press, Cambridge Cambridge (2007)"},{"key":"17_CR29","unstructured":"V\u00e4\u00e4n\u00e4nen, J., Hodges, W.: Dependence of variables construed as an atomic formula (2008)"},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.ic.2016.07.008","volume":"253","author":"J Virtema","year":"2017","unstructured":"Virtema, J.: Complexity of validity for propositional dependence logics. Inf. Comput. 253, 224\u2013236 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.07.008","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39784-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T13:06:36Z","timestamp":1701176796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39784-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031397837","9783031397844"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39784-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2023","order":10,"name":"conference_id","label":"Conference ID","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":"43","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":"21","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":"49% - 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","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":"4.6","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)"}}]}}