{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:37:13Z","timestamp":1756895833682,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584740"},{"type":"electronic","value":"9783030584757"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-58475-7_21","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"358-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Phase Transition Behavior in Knowledge Compilation"],"prefix":"10.1007","author":[{"given":"Rahul","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Subhajit","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Achlioptas, D., Coja-Oghlan, A.: Algorithmic barriers from phase transitions. In: IEEE Symposium on Foundations of Computer Science, pp. 793\u2013802, October 2008. https:\/\/doi.org\/10.1109\/FOCS.2008.11","DOI":"10.1109\/FOCS.2008.11"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Achlioptas, D.: Random satisfiability. In: Handbook of Satisfiability, pp. 245\u2013270 (2009). https:\/\/doi.org\/10.3233\/978-1-58603-929-5-245","DOI":"10.3233\/978-1-58603-929-5-245"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0017433","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"D Achlioptas","year":"1997","unstructured":"Achlioptas, D., Kirousis, L.M., Kranakis, E., Krizanc, D., Molloy, M.S.O., Stamatiou, Y.C.: Random constraint satisfaction: a more accurate picture. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 107\u2013120. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0017433"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-45578-7_9","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"ASM Aguirre","year":"2001","unstructured":"Aguirre, A.S.M., Vardi, M.Y.: Random 3-SAT and BDDs: the plot thickens further. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 121\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_9"},{"key":"21_CR5","unstructured":"Bayardo Jr., R.J., Pehoushek, J.D.: Counting models using connected components. In: AAAI, pp. 157\u2013162 (2000)"},{"key":"21_CR6","unstructured":"Birnbaum, E., Lozinskii, E.L.: The good old Davis-Putnam procedure helps counting models. J. Artif. Int. Res. 10(1), 457\u2013477 (1999). http:\/\/dl.acm.org\/citation.cfm?id=1622859.1622875"},{"key":"21_CR7","unstructured":"Bova, S.: SDDs are exponentially more succinct than OBDDs. In: Proceedings of AAAI, pp. 929\u2013935. AAAI Press (2016). http:\/\/dl.acm.org\/citation.cfm?id=3015812.3015951"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.v27:2","volume":"27","author":"A Braunstein","year":"2005","unstructured":"Braunstein, A., M\u00e9zard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Struct. Algorithms 27(2), 201\u2013226 (2005). https:\/\/doi.org\/10.1002\/rsa.v27:2","journal-title":"Random Struct. Algorithms"},{"issue":"8","key":"21_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"key":"21_CR10","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of IJCAI, pp. 331\u2013337 (1991). http:\/\/dl.acm.org\/citation.cfm?id=1631171.1631221"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. J. Appl. Non-Classical Logics 11, 11\u201334 (2001)","journal-title":"J. Appl. Non-Classical Logics"},{"key":"21_CR12","unstructured":"Darwiche, A.: New advances in compiling CNF to decomposable negation normal form. In: Proceedings of ECAI, pp. 318\u2013322 (2004)"},{"key":"21_CR13","unstructured":"Darwiche, A.: SDD: a new canonical representation of propositional knowledge bases. In: Proceedings of IJCAI, pp. 819\u2013826 (2011)"},{"key":"21_CR14","first-page":"229","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Int. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Int. Res."},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Ding, J., Sly, A., Sun, N.: Proof of the satisfiability conjecture for large k. In: Proceedings of STOC (2015). https:\/\/doi.org\/10.1145\/2746539.2746619","DOI":"10.1145\/2746539.2746619"},{"key":"21_CR16","unstructured":"Dudek, J., Meel, K.S., Vardi, M.Y.: Combining the k-CNF and XOR phase-transitions. In: Proceedings of IJCAI, July 2016"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Dudek, J., Meel, K.S., Vardi, M.Y.: The hard problems are almost everywhere for random CNF-XOR formulas. In: Proceedings of IJCAI, August 2017","DOI":"10.24963\/ijcai.2017\/84"},{"key":"21_CR18","unstructured":"Erdos, P., Renyi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17\u201361 (1960)"},{"key":"21_CR19","unstructured":"Filippidis, I.: dd Python Package, Release 0.5.4 (2019). Mirrored on https:\/\/pypi.org\/project\/dd\/. Accessed 04 Sept 2019"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-21581-0_31","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"J Gao","year":"2011","unstructured":"Gao, J., Yin, M., Xu, K.: Phase transitions in knowledge compilation: an experimental study. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 364\u2013366. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21581-0_31"},{"issue":"4","key":"21_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1011454308633","volume":"6","author":"IP Gent","year":"2001","unstructured":"Gent, I.P., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: Random constraint satisfaction: flaws and structure. Constraints Int. J. 6(4), 345\u2013372 (2001). https:\/\/doi.org\/10.1023\/A:1011454308633","journal-title":"Constraints Int. J."},{"key":"21_CR22","unstructured":"Gent, I.P., Walsh, T.: The SAT phase transition. In: Proceedings of ECAI 1994, pp. 105\u2013109 (1994)"},{"key":"21_CR23","unstructured":"Gent, I.P., Walsh, T.: Beyond NP: the QSAT phase transition, pp. 648\u2013653. AAAI Press (1999)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11527695_13","volume-title":"Theory and Applications of Satisfiability Testing","author":"J Huang","year":"2005","unstructured":"Huang, J., Darwiche, A.: Using DPLL for efficient OBDD construction. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 157\u2013172. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527695_13"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Jean-Marie Lagniez, P.M.: An improved decision-DNNF compiler. In: Proceedings of IJCAI, pp. 667\u2013673 (2017)","DOI":"10.24963\/ijcai.2017\/93"},{"key":"21_CR26","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: AAAI, vol. 92, pp. 459\u2013465 (1992)"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1007\/s10955-008-9543-x","volume":"131","author":"T Mora","year":"2008","unstructured":"Mora, T., Zdeborov\u00e1, L.: Random subcubes as a toy model for constraint satisfaction problems. J. Stat. Phys. 131, 1121\u20131138 (2008)","journal-title":"J. Stat. Phys."},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Muise, C., McIlraith, S.A., Beck, J.C., Hsu, E.: DSHARP: fast d-DNNF Compilation with sharpSAT. In: Proceedings of AAAI, pp. 356\u2013361 (2016)","DOI":"10.1007\/978-3-642-30353-1_36"},{"key":"21_CR29","unstructured":"Oztok, U., Darwiche, A.: A top-down compiler for sentential decision diagrams. In: Proceedings of the 24th International Conference on Artificial Intelligence, IJCAI 2015, pp. 3141\u20133148. AAAI Press (2015)"},{"issue":"1","key":"21_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.1.11201","volume":"62","author":"U Oztok","year":"2018","unstructured":"Oztok, U., Darwiche, A.: An exhaustive DPLL algorithm for model counting. J. Artif. Int. Res. 62(1), 1\u201332 (2018). https:\/\/doi.org\/10.1613\/jair.1.11201","journal-title":"J. Artif. Int. Res."},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Pote, Y., Joshi, S., Meel, K.S.: Phase transition behavior of cardinality and XOR constraints. In: Proceedings of IJCAI, August 2019","DOI":"10.24963\/ijcai.2019\/162"},{"key":"21_CR32","unstructured":"Somenzi, F.: CUDD Package, Release 3.0.0 (2004). Mirrored on https:\/\/sourceforge.net\/projects\/cudd-mirror\/. Accessed 04 Sept 2019"},{"key":"21_CR33","unstructured":"The SDD package, ver 2.0 (2018). http:\/\/reasoning.cs.ucla.edu\/sdd\/. Accessed 5 June 2019"},{"key":"21_CR34","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","volume":"70","author":"C Williams","year":"1994","unstructured":"Williams, C., Hogg, T.: Exploiting the deep structure of constraint problems. Artif. Intell. 70, 73\u2013117 (1994)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T14:45:43Z","timestamp":1619189143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_21","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":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","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":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"122","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":"55","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":"45% - 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.13","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.47","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}