{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:37Z","timestamp":1750309297564,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"FNR","award":["C19\/IS\/13566661\/BEEHIVE\/Cordy","17047437"],"award-info":[{"award-number":["C19\/IS\/13566661\/BEEHIVE\/Cordy","17047437"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,14]]},"DOI":"10.1145\/3639478.3643097","type":"proceedings-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T10:49:26Z","timestamp":1716461366000},"page":"322-323","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploring the Computational Complexity of SAT Counting and Uniform Sampling with Phase Transitions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0378-5643","authenticated-orcid":false,"given":"Olivier","family":"Zeyen","sequence":"first","affiliation":[{"name":"University of Luxembourg, SnT, Luxembourg, Luxembourg"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8312-1358","authenticated-orcid":false,"given":"Maxime","family":"Cordy","sequence":"additional","affiliation":[{"name":"SnT, University of Luxembourg, Luxembourg, Luxembourg"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8431-0377","authenticated-orcid":false,"given":"Gilles","family":"Perrouin","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Namur, Namur, Belgium"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1483-3858","authenticated-orcid":false,"given":"Mathieu","family":"Acher","sequence":"additional","affiliation":[{"name":"Univ Rennes, Inria, CNRS, IRISA, Rennes, France"}]}],"member":"320","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The Community Structure of SAT Formulas. In International Conference on Theory and Applications of Satisfiability Testing.","author":"Ans\u00f3tegui Carlos","year":"2012","unstructured":"Carlos Ans\u00f3tegui, Jes\u00fas Gir\u00e1ldez-Cru, and Jordi Levy. 2012. The Community Structure of SAT Formulas. In International Conference on Theory and Applications of Satisfiability Testing."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE43902.2021.00039"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750423.2750434"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754760"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"A randomized diversification strategy for solving satisfiability problem with long clauses","volume":"60","author":"Gao Jian","year":"2017","unstructured":"Jian Gao, Ruizhi Li, and Minghao Yin. 2017. A randomized diversification strategy for solving satisfiability problem with long clauses. Science China Information Sciences 60 (2017), 1--11. https:\/\/api.semanticscholar.org\/CorpusID:13219850","journal-title":"Science China Information Sciences"},{"volume-title":"The SAT Phase Transition. In European Conference on Artificial Intelligence.","author":"Ian","key":"e_1_3_2_1_6_1","unstructured":"Ian P. Gent and Toby Walsh. 1994. The SAT Phase Transition. In European Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_7_1","volume-title":"Carlos Cerrada, and Enrique Enrique Herrera-Viedma.","author":"Heradio Ruben","year":"2016","unstructured":"Ruben Heradio, Hector Perez-Morago, David Fern\u00e1ndez-Amor\u00f3s, Roberto Bean, Francisco Javier Cabrerizo, Carlos Cerrada, and Enrique Enrique Herrera-Viedma. 2016. Binary Decision Diagram Algorithms to Perform Hard Analysis Operations on Variability Models. In New Trends in Software Methodologies, Tools and Techniques."},{"volume-title":"Model Counting in Product Configuration","author":"K\u00fcbler Andreas","key":"e_1_3_2_1_8_1","unstructured":"Andreas K\u00fcbler, Christoph Zengler, and Wolfgang K\u00fcchlin. 2010. Model Counting in Product Configuration. In LoCoCo."},{"volume-title":"Hard and Easy Distributions of SAT Problems. In AAAI Conference on Artificial Intelligence.","author":"Mitchell David G.","key":"e_1_3_2_1_9_1","unstructured":"David G. Mitchell, Bart Selman, and Hector J. Levesque. 1992. Hard and Easy Distributions of SAT Problems. In AAAI Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_10_1","volume-title":"Determining computational complexity from characteristic 'phase transitions'. Nature 400, 6740","author":"Monasson R\u00e9mi","year":"1999","unstructured":"R\u00e9mi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, and Lidror Troyansky. 1999. Determining computational complexity from characteristic 'phase transitions'. Nature 400, 6740 (1999), 133--137."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 23rd International Systems and Software Product Line Conference, SPLC 2019","volume":"13","author":"Oh Jeho","year":"2019","unstructured":"Jeho Oh, Paul Gazzillo, and Don S. Batory. 2019. t-wise coverage by uniform sampling. In Proceedings of the 23rd International Systems and Software Product Line Conference, SPLC 2019, Volume A, Paris, France, September 9--13, 2019, Thorsten Berger, Philippe Collet, Laurence Duchien, Thomas Fogdal, Patrick Heymans, Timo Kehrer, Jabier Martinez, Ra\u00fal Mazo, Leticia Montalvillo, Camille Salinesi, Xhevahire T\u00ebrnava, Thomas Th\u00fcm, and Tewfik Ziadi (Eds.). ACM, 15:1--15:4."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2019.00032"},{"key":"e_1_3_2_1_14_1","volume-title":"Meel","author":"Pote Yash","year":"2019","unstructured":"Yash Pote, Saurabh Joshi, and Kuldeep S. Meel. 2019. Phase Transition Behavior of Cardinality and XOR Constraints. ArXiv abs\/1910.09755 (2019). https:\/\/api.semanticscholar.org\/CorpusID:199465708"},{"key":"e_1_3_2_1_15_1","volume-title":"Jeffrey M. Young, Thomas Th\u00fcm, and Ina Schaefer.","author":"Sundermann Chico","year":"2023","unstructured":"Chico Sundermann, Tobias He\u00df, Michael Nieke, Paul Maximilian Bittner, Jeffrey M. Young, Thomas Th\u00fcm, and Ina Schaefer. 2023. Evaluating state-of-the-art # SAT solvers on industrial configuration spaces. Empirical Software Engineering 28 (2023)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442391.3442404"}],"event":{"name":"ICSE-Companion '24: 2024 IEEE\/ACM 46th International Conference on Software Engineering: Companion Proceedings","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS","Faculty of Engineering of University of Porto"],"location":"Lisbon Portugal","acronym":"ICSE-Companion '24"},"container-title":["Proceedings of the 2024 IEEE\/ACM 46th International Conference on Software Engineering: Companion Proceedings"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639478.3643097","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639478.3643097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:37Z","timestamp":1750291417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639478.3643097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,14]]},"references-count":15,"alternative-id":["10.1145\/3639478.3643097","10.1145\/3639478"],"URL":"https:\/\/doi.org\/10.1145\/3639478.3643097","relation":{},"subject":[],"published":{"date-parts":[[2024,4,14]]},"assertion":[{"value":"2024-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}