{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:01:48Z","timestamp":1742950908083,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030399504"},{"type":"electronic","value":"9783030399511"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39951-1_10","type":"book-chapter","created":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T19:02:22Z","timestamp":1580670142000},"page":"157-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence 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-8061-5376","authenticated-orcid":false,"given":"Arne","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31803-5","volume-title":"Dependence Logic, Theory and Applications","year":"2016","unstructured":"Abramsky, S., Kontinen, J., V\u00e4\u00e4n\u00e4nen, J., Vollmer, H. (eds.): Dependence Logic, Theory and Applications. Springer, Basel (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-31803-5"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Friedrich, T., Schirneck, M.: The parameterized complexity of dependency detection in relational databases. In: Guo, J., Hermelin, D. (eds.) 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 63, pp. 6:1\u20136:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/6920\n\n, \nhttps:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2016.6","DOI":"10.4230\/LIPIcs.IPEC.2016.6"},{"key":"10_CR3","unstructured":"Chen, H., Mengel, S.: A trichotomy in the complexity of counting answers to conjunctive queries. In: Arenas, M., Ugarte, M. (eds.) 18th International Conference on Database Theory, ICDT 2015, Brussels, Belgium, 23\u201327 March 2015. LIPIcs, vol. 31. pp. 110\u2013126. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2015.110"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Chen, H., Mengel, S.: Counting answers to existential positive queries: a complexity classification. In: Milo, T., Tan, W.-C. (eds.) Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, 26 June\u201301 July 2016, pp. 315\u2013326. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2902251.2902279","DOI":"10.1145\/2902251.2902279"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Chen, H., Mengel, S.: The logic of counting query answers. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, 20\u201323 June 2017, pp. 1\u201312. IEEE Computer Society (2017). \nhttps:\/\/doi.org\/10.1109\/LICS.2017.8005085","DOI":"10.1109\/LICS.2017.8005085"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2751316","volume":"7","author":"H Chen","year":"2015","unstructured":"Chen, H., M\u00fcller, M.: The fine classification of conjunctive queries and parameterized logarithmic space. TOCT 7(2), 7:1\u20137:27 (2015). \nhttps:\/\/doi.org\/10.1145\/2751316","journal-title":"TOCT"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-36976-6_6","volume-title":"Logic, Language, and Computation","author":"I Ciardelli","year":"2013","unstructured":"Ciardelli, I., Groenendijk, J., Roelofsen, F.: Towards a logic of information exchange - an inquisitive witness semantics. In: Bezhanishvili, G., L\u00f6bner, S., Marra, V., Richter, F. (eds.) TbiLLC 2011. LNCS, vol. 7758, pp. 51\u201372. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36976-6_6"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Harrison, M.A., Banerji, R.B., Ullman, J.D. (eds.) Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, USA, 3\u20135 May 1971, pp. 151\u2013158. ACM (1971). \nhttps:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"10_CR10","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. Texts in Computer Science. Springer, London (2013). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"3\u20134","key":"10_CR11","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). \nhttps:\/\/doi.org\/10.1007\/s10472-017-9568-4","journal-title":"Ann. Math. Artif. Intell."},{"key":"10_CR12","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-90050-6_11"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1007\/s00224-014-9543-y","volume":"57","author":"A Durand","year":"2015","unstructured":"Durand, A., Mengel, S.: Structural tractability of counting of solutions to conjunctive queries. Theory Comput. Syst. 57(4), 1202\u20131249 (2015). \nhttps:\/\/doi.org\/10.1007\/s00224-014-9543-y","journal-title":"Theory Comput. Syst."},{"key":"10_CR14","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-27660-6_19"},{"key":"10_CR15","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. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"1","key":"10_CR16","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. Log. 163(1), 68\u201384 (2012). \nhttps:\/\/doi.org\/10.1016\/j.apal.2011.08.005","journal-title":"Ann. Pure Appl. Log."},{"key":"10_CR17","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). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2012.10.033","journal-title":"Theor. Comput. Sci."},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Gr\u00e4del, E., Kontinen, J., V\u00e4\u00e4n\u00e4nen, J., Vollmer, H.: Logics for dependence and independence (Dagstuhl seminar 15261). Dagstuhl Reports 5(6), 70\u201385 (2016). \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/5508\n\n, \nhttps:\/\/doi.org\/10.4230\/DagRep.5.6.70","DOI":"10.4230\/DagRep.5.6.70"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Grohe, M., Schwentick, T., Segoufin, L.: When is the evaluation of conjunctive queries tractable? In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) Proceedings on 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, 6\u20138 July 2001, pp. 657\u2013666. ACM (2001). \nhttps:\/\/doi.org\/10.1145\/380752.380867","DOI":"10.1145\/380752.380867"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-319-72056-2_12","volume-title":"Logical Foundations of Computer Science","author":"M Hannula","year":"2018","unstructured":"Hannula, M., Kontinen, J., Virtema, J.: Polyteam semantics. In: Artemov, S., Nerode, A. (eds.) LFCS 2018. LNCS, vol. 10703, pp. 190\u2013210. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-72056-2_12"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/3157054","volume":"19","author":"M Hannula","year":"2018","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). \nhttps:\/\/doi.org\/10.1145\/3157054","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR22","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exz008","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. (2019). \nhttps:\/\/doi.org\/10.1093\/logcom\/exz008","journal-title":"J. Log. Comput."},{"issue":"5","key":"10_CR23","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1093\/logcom\/exw019","volume":"27","author":"J Kontinen","year":"2017","unstructured":"Kontinen, J., M\u00fcller, J.-S., Schnoor, H., Vollmer, H.: Modal independence logic. J. Log. Comput. 27(5), 1333\u20131352 (2017). \nhttps:\/\/doi.org\/10.1093\/logcom\/exw019","journal-title":"J. Log. Comput."},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Krebs, A., Meier, A., Virtema, J.: A team based variant of CTL. In: Grandi, F., Lange, M., Lomuscio, A. (eds.) 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, 23\u201325 September 2015, pp. 140\u2013149. IEEE Computer Society (2015). \nhttps:\/\/doi.org\/10.1109\/TIME.2015.11","DOI":"10.1109\/TIME.2015.11"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Krebs, A., Meier, A., Virtema, J., Zimmermann, M.: Team semantics for the specification and verification of hyperproperties. In: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, UK, 27\u201331 August 2018. LIPIcs, vol. 117, pp. 10:1\u201310:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.10","DOI":"10.4230\/LIPIcs.MFCS.2018.10"},{"issue":"3","key":"10_CR26","first-page":"115","volume":"9","author":"L Levin","year":"1973","unstructured":"Levin, L.: Universal search problems. Probl. Inf. Transm. 9(3), 115\u2013116 (1973)","journal-title":"Probl. Inf. Transm."},{"issue":"2","key":"10_CR27","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. Studia Logica 101(2), 343\u2013366 (2013). \nhttps:\/\/doi.org\/10.1007\/s11225-013-9483-6","journal-title":"Studia Logica"},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/3001835","volume":"18","author":"M L\u00fcck","year":"2017","unstructured":"L\u00fcck, M., Meier, A., Schindler, I.: Parameterised complexity of satisfiability in temporal logic. ACM Trans. Comput. Log. 18(1), 1:1\u20131:32 (2017). \nhttps:\/\/doi.org\/10.1145\/3001835","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR29","unstructured":"Mahmood, Y., Meier, A.: Parameterised complexity of model checking and satisfiability in propositional dependence logic. CoRR, abs\/1904.06107 (2019). \nhttp:\/\/arxiv.org\/abs\/1904.06107"},{"key":"10_CR30","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-90050-6_17"},{"key":"10_CR31","volume-title":"Theories of Computability","author":"N Pippenger","year":"1997","unstructured":"Pippenger, N.: Theories of Computability. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"10_CR32","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory Ser. B 41(1), 92\u2013114 (1986). \nhttps:\/\/doi.org\/10.1016\/0095-8956(86)90030-4","journal-title":"J. Comb. Theory Ser. B"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Samer, M., Szeider, S.: Fixed-parameter tractability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 425\u2013454. IOS Press (2009). \nhttps:\/\/doi.org\/10.3233\/978-1-58603-929-5-425","DOI":"10.3233\/978-1-58603-929-5-425"},{"issue":"1","key":"10_CR34","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jda.2009.06.002","volume":"8","author":"M Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithms 8(1), 50\u201364 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"V\u00e4\u00e4n\u00e4nen, J.A.: Dependence Logic - A New Approach to Independence Friendly Logic. London Mathematical Society Student Texts, vol. 70. Cambridge University Press, Cambridge (2007). \nhttp:\/\/www.cambridge.org\/de\/knowledge\/isbn\/item1164246\/?site_locale=de_DE","DOI":"10.1017\/CBO9780511611193"},{"key":"10_CR36","unstructured":"V\u00e4\u00e4n\u00e4nen, J.A.: Modal dependence logic. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction. Amsterdam University Press, Amsterdam (2008)"},{"issue":"7","key":"10_CR37","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.apal.2016.03.003","volume":"167","author":"F Yang","year":"2016","unstructured":"Yang, F., V\u00e4\u00e4n\u00e4nen, J.: Propositional logics of dependence. Ann. Pure Appl. Log. 167(7), 557\u2013589 (2016). \nhttps:\/\/doi.org\/10.1016\/j.apal.2016.03.003","journal-title":"Ann. Pure Appl. Log."}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39951-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T05:46:45Z","timestamp":1580795205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39951-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030399504","9783030399511"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39951-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoIKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations of Information and Knowledge Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"foiks2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/foiks2020.cs.tu-dortmund.de\/","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":"33","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":"19","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":"58% - 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":"2","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)"}}]}}