{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:42:49Z","timestamp":1743036169312,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030367541"},{"type":"electronic","value":"9783030367558"}],"license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"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-36755-8_13","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T10:05:16Z","timestamp":1576490716000},"page":"195-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterised Complexity of Abduction in Schaefer\u2019s Framework"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5651-5391","authenticated-orcid":false,"given":"Yasir","family":"Mahmood","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8061-5376","authenticated-orcid":false,"given":"Arne","family":"Meier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8551-1624","authenticated-orcid":false,"given":"Johannes","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"13:1","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. Logic (TOCL) 12(2), 13:1\u201313:28 (2011)","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"13_CR2","unstructured":"Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The complexity of generalized satisfiability for linear temporal logic. Log. Methods Comput. Sci. 5(1) (2009). \nhttp:\/\/arxiv.org\/abs\/0812.4848"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1093\/logcom\/exq061","volume":"22","author":"O Beyersdorff","year":"2012","unstructured":"Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of reasoning for fragments of default logic. J. Log. Comput. 22(3), 587\u2013604 (2012). \nhttps:\/\/doi.org\/10.1093\/logcom\/exq061","journal-title":"J. Log. Comput."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2005.06.003","volume":"96","author":"E B\u00f6hler","year":"2005","unstructured":"B\u00f6hler, E., Reith, S., Schnoor, H., Vollmer, H.: Bases for Boolean co-clones. Inf. Process. Lett. 96(2), 59\u201366 (2005). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2005.06.003","journal-title":"Inf. Process. Lett."},{"issue":"9","key":"13_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3390\/a12090189","volume":"12","author":"Nadia Creignou","year":"2019","unstructured":"Creignou, N., Ktari, R., M\u00fcller, J.S., Olive, F., Vollmer, H.: Parameterised enumeration for modification problems. Algorithms 12(9) (2019). \nhttps:\/\/doi.org\/10.3390\/a12090189","journal-title":"Algorithms"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s00224-016-9702-4","volume":"60","author":"N Creignou","year":"2017","unstructured":"Creignou, N., Meier, A., M\u00fcller, J.S., Schmidt, J., Vollmer, H.: Paradigms for parameterized enumeration. Theory Comput. Syst. 60(4), 737\u2013758 (2017). \nhttps:\/\/doi.org\/10.1007\/s00224-016-9702-4","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2159531.2159539","volume":"13","author":"N Creignou","year":"2012","unstructured":"Creignou, N., Meier, A., Thomas, M., Vollmer, H.: The complexity of reasoning for fragments of autoepistemic logic. ACM Trans. Comput. Logic 13(2), 17:1\u201317:22 (2012). \nhttps:\/\/doi.org\/10.1145\/2159531.2159539","journal-title":"ACM Trans. Comput. Logic"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-21581-0_11","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"N Creignou","year":"2011","unstructured":"Creignou, N., Olive, F., Schmidt, J.: Enumerating all solutions of a Boolean CSP by non-decreasing weight. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 120\u2013133. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21581-0_11"},{"key":"13_CR9","unstructured":"Creignou, N., Schmidt, J., Thomas, M.: Complexity of propositional abduction for restricted sets of Boolean functions. In: Lin, F., Sattler, U., Truszczynski, M. (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, 9\u201313 May 2010. AAAI Press (2010). \nhttp:\/\/aaai.org\/ocs\/index.php\/KR\/KR2010\/paper\/view\/1201"},{"issue":"5","key":"13_CR10","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1093\/logcom\/exr012","volume":"22","author":"N Creignou","year":"2012","unstructured":"Creignou, N., Schmidt, J., Thomas, M.: Complexity classifications for propositional abduction in post\u2019s framework. J. Log. Comput. 22(5), 1145\u20131170 (2012). \nhttps:\/\/doi.org\/10.1093\/logcom\/exr012","journal-title":"J. Log. Comput."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-15675-5_12","volume-title":"Logics in Artificial Intelligence","author":"N Creignou","year":"2010","unstructured":"Creignou, N., Schmidt, J., Thomas, M., Woltran, S.: Sets of Boolean connectives that make argumentation easier. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS (LNAI), vol. 6341, pp. 117\u2013129. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15675-5_12"},{"issue":"2\u20133","key":"13_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/19462166.2011.629736","volume":"2","author":"N Creignou","year":"2011","unstructured":"Creignou, N., Schmidt, J., Thomas, M., Woltran, S.: Complexity of logic-based argumentation in post\u2019s framework. Argum. Comput. 2(2\u20133), 107\u2013129 (2011). \nhttps:\/\/doi.org\/10.1080\/19462166.2011.629736","journal-title":"Argum. Comput."},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0097539704446311","volume":"36","author":"N Creignou","year":"2006","unstructured":"Creignou, N., Zanuttini, B.: A complete classification of the complexity of propositional abduction. SIAM J. Comput. 36(1), 207\u2013229 (2006). \nhttps:\/\/doi.org\/10.1137\/S0097539704446311","journal-title":"SIAM J. Comput."},{"key":"13_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity. Monographs in Computer Science","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity. Texts in Computer Science","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-36494-3_40","volume-title":"STACS 2003","author":"A Durand","year":"2003","unstructured":"Durand, A., Hermann, M.: The inference problem for propositional circumscription of afine formulas Is coNP-complete. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 451\u2013462. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36494-3_40"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/200836.200838","volume":"42","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM 42(1), 3\u201342 (1995). \nhttps:\/\/doi.org\/10.1145\/200836.200838","journal-title":"J. ACM"},{"key":"13_CR18","unstructured":"Fellows, M.R., Pfandler, A., Rosamond, F.A., R\u00fcmmele, S.: The parameterized complexity of abduction. In: Hoffmann, J., Selman, B. (eds.), Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2 July 2012, Toronto, Ontario, Canada. AAAI Press (2012). \nhttp:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI12\/paper\/view\/5048"},{"key":"13_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series","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"},{"key":"13_CR20","unstructured":"Hemaspaandra, E., Schnoor, H., Schnoor, I.: Generalized modal satisfiability. CoRR, abs\/0804.2729:1\u201332 (2008). \nhttp:\/\/arxiv.org\/abs\/0804.2729"},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TSMC.1987.4309060","volume":"17","author":"JR Josephson","year":"1987","unstructured":"Josephson, J.R., Chandrasekaran, B., Smith, J.W., Tanner, M.C.: A mechanism for forming composite explanatory hypotheses. IEEE Trans. Syst. Man Cybern. 17(3), 445\u2013454 (1987). \nhttps:\/\/doi.org\/10.1109\/TSMC.1987.4309060","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01744287","volume":"13","author":"HR Lewis","year":"1979","unstructured":"Lewis, H.R.: Satisfiability problems for propositional calculi. Math. Sys. Theory 13, 45\u201353 (1979)","journal-title":"Math. Sys. Theory"},{"key":"13_CR23","unstructured":"Mahmood, Y., Meier, A., Schmidt, J.: Parameterised complexity for abduction. CoRR, abs\/1906.00703 (2019)"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-642-03816-7_50","volume-title":"Mathematical Foundations of Computer Science 2009","author":"A Meier","year":"2009","unstructured":"Meier, A., Mundhenk, M., Schneider, T., Thomas, M., Weber, V., Weiss, F.: The complexity of satisfiability for fragments of hybrid logic\u2014Part I. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 587\u2013599. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03816-7_50"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2013.02.009","volume":"505","author":"A Meier","year":"2013","unstructured":"Meier, A., Schneider, T.: Generalized satisfiability for the description logic ALC. Theor. Comput. Sci. 505, 55\u201373 (2013). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2013.02.009","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"13_CR26","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1142\/S0129054109006954","volume":"20","author":"A Meier","year":"2009","unstructured":"Meier, A., Thomas, M., Vollmer, H., Mundhenk, M.: The complexity of satisfiability for fragments of CTL and ctl*. Int. J. Found. Comput. Sci. 20(5), 901\u2013918 (2009). \nhttps:\/\/doi.org\/10.1142\/S0129054109006954","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"13_CR27","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0004-3702(71)90009-9","volume":"2","author":"CG Morgan","year":"1971","unstructured":"Morgan, C.G.: Hypothesis generation by machine. Artif. Intell. 2(2), 179\u2013187 (1971). \nhttps:\/\/doi.org\/10.1016\/0004-3702(71)90009-9","journal-title":"Artif. Intell."},{"issue":"10","key":"13_CR28","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.artint.2008.02.001","volume":"172","author":"G Nordh","year":"2008","unstructured":"Nordh, G., Zanuttini, B.: What makes propositional abduction tractable. Artif. Intell. 172(10), 1245\u20131284 (2008). \nhttps:\/\/doi.org\/10.1016\/j.artint.2008.02.001","journal-title":"Artif. Intell."},{"key":"13_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, Cambridge (2014). \nhttp:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/algorithmics-complexity-computer-algebra-and-computational-g\/analysis-boolean-functions"},{"key":"13_CR30","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"13_CR31","volume-title":"Collected Papers of Charles Sanders Peirce","author":"CS Peirce","year":"1958","unstructured":"Peirce, C.S.: Collected Papers of Charles Sanders Peirce. Oxford University Press, London (1958)"},{"key":"13_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8682-5","volume-title":"Abductive Inference Models for Diagnostic Problem-Solving","author":"Yun Peng","year":"1990","unstructured":"Peng, Y., Reggia, J.A.: Abductive Inference Models for Diagnostic Problem-Solving. Artificial Intelligence. Springer. New York (1990). \nhttps:\/\/doi.org\/10.1007\/978-1-4419-8682-5"},{"key":"13_CR33","unstructured":"Poole, D.: Normality and faults in logic-based diagnosis. In: Sridharan, N.S. (ed.), Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, MI, USA, August 1989, pp. 1304\u20131310. Morgan Kaufmann (1989). \nhttp:\/\/ijcai.org\/Proceedings\/89-2\/Papers\/073.pdf"},{"key":"13_CR34","first-page":"1","volume":"5","author":"EL Post","year":"1941","unstructured":"Post, E.L.: The two-valued iterative systems of mathematical logic. Ann. Math. Stud. 5, 1\u2013122 (1941)","journal-title":"Ann. Math. Stud."},{"key":"13_CR35","unstructured":"Reith, S.: Generalized satisfiability problems. Ph.D. thesis, Julius Maximilians University W\u00fcrzburg, Germany (2001). \nhttp:\/\/opus.bibliothek.uni-wuerzburg.de\/opus\/volltexte\/2002\/7\/index.html"},{"issue":"3","key":"13_CR36","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986). \nhttps:\/\/doi.org\/10.1016\/0196-6774(86)90023-4","journal-title":"J. Algorithms"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.), Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 1\u20133 May 1978, pp. 216\u2013226. ACM (1978). \nhttps:\/\/doi.org\/10.1145\/800133.804350","DOI":"10.1145\/800133.804350"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-92800-3_9","volume-title":"Complexity of Constraints","author":"H Schnoor","year":"2008","unstructured":"Schnoor, H., Schnoor, I.: Partial polymorphisms and constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 229\u2013254. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-92800-3_9"},{"key":"13_CR39","unstructured":"Selman, B., Levesque, H.J.: Abductive and default reasoning: a computational core. In: Shrobe, H.E., Dietterich, T.G., Swartout, W.R. (eds.), Proceedings of the 8th National Conference on Artificial Intelligence, Boston, Massachusetts, USA, 29 July\u20133 August 1990, vol. 2, pp. 343\u2013348. AAAI Press\/The MIT Press (1990). \nhttp:\/\/www.aaai.org\/Library\/AAAI\/1990\/aaai90-053.php"},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-04238-6_25","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Thomas","year":"2009","unstructured":"Thomas, M.: The complexity of circumscriptive inference in post\u2019s lattice. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 290\u2013302. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04238-6_25"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36755-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T19:03:56Z","timestamp":1576782236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36755-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030367541","9783030367558"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36755-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"20 December 2019","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/lfcs-2020\/","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":"30","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":"17","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":"57% - 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.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":"3.7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}