{"type":"ScholarlyArticle","title":"AllSATCC: Boosting AllSAT Solving with Efficient Component Analysis","authors":[{"name":"Jiaxin Liang","slug":"jiaxin-liang","given":"Jiaxin","family":"Liang","affiliation":"Northeast Normal University , China"},{"name":"Feifei Ma","slug":"feifei-ma","given":"Feifei","family":"Ma","affiliation":"Institute of Software , Chinese Academy of Sciences , China"},{"name":"Junping Zhou","slug":"junping-zhou","given":"Junping","family":"Zhou","affiliation":"Northeast Normal University , China"},{"name":"Minghao Yin","slug":"minghao-yin","given":"Minghao","family":"Yin","affiliation":"Northeast Normal University , China"}],"abstract":"All Solution SAT (AllSAT) is a variant of Propositional Satisfiability, which aims to find all satisfying assignments for a given formula. AllSAT has significant applications in different domains, such as software testing, data mining, and network verification. In this paper, observing that the lack of component analysis may result in more work for algorithms with non-chronological backtracking, we propose a DPLL-based algorithm for solving AllSAT problem, named AllSATCC, which takes advantage of component analysis to reduce work repetition caused by non-chronological backtracking. The experimental results show that our algorithm outperforms the state-of-the-art algorithms on most instances.","doi":"10.24963/ijcai.2022/259","url":"https://ijcai.org/proceedings/2022/259","pdf":"https://ijcai.org/proceedings/2022/0259.pdf","markdown":"https://ijcai.org/proceedings/2022/259.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/259","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":259,"pages":{"first":1866,"last":1872},"keywords":["Constraint Satisfaction and Optimization: Solvers and Tools","Constraint Satisfaction and Optimization: Satisfiabilty"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986625","length_sec":79,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984768","length_sec":331,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Chen and Marques-Silva, 2012] Huan Chen and Joao Marques-Silva. TG-Pro: a SAT-based ATPG sys- tem. Journal on Satisfiability, Boolean Modeling and Computation, 8(1-2):83-88, 2012.","title":"TG-Pro: a SAT-based ATPG system","authors":"Chen, Marques-Silva ; Huan Chen, Joao Marques-Silva","year":"2012","venue":"Boolean Modeling and Computation","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Dlala et al., 2016] Imen Ouled Dlala, Said Jabbour, Lakhdar Sais, and Boutheina Ben Yaghlane. A compara- tive study of SAT-based itemsets mining. In International Conference on Innovative Techniques and Applications of Artificial Intelligence, pages 37-52. Springer, 2016.","title":"A comparative study of SAT-based itemsets mining","authors":"Imen Ouled Dlala, Said Jabbour, Lakhdar Sais, Boutheina Ben, Yaghlane","year":"2016","venue":"International Conference on Innovative Techniques and Applications of Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Grumberg et al., 2004] Orna Grumberg, Assaf Schuster, and Avi Yadgar. Memory efficient all-solutions SAT solver and its application for reachability analysis. In Interna- tional Conference on Formal Methods in Computer-Aided Design, pages 275-289. Springer, 2004.","title":"Memory efficient all-solutions SAT solver and its application for reachability analysis","authors":"Orna Grumberg, Assaf Schuster, Avi Yadgar","year":"2004","venue":"International Conference on Formal Methods in Computer-Aided Design","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Huang and Darwiche, 2004] Jinbo Huang and Adnan Dar- wiche. Using DPLL for efficient OBDD construction. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, pages 157-172. Springer, 2004.","title":"Using DPLL for efficient OBDD construction","authors":"Darwiche Huang","year":"2004","venue":"Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Jin et al., 2005] HoonSang Jin, HyoJung Han, and Fabio Somenzi. Efficient conflict analysis for finding all satisfy- ing assignments of a boolean circuit. In Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 287-300. Springer, 2005.","title":"Efficient conflict analysis for finding all satisfying assignments of a boolean circuit","authors":"Jin","year":"2005","venue":"Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Khurshid et al., 2003] Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, and Daniel Jackson. A case for efficient solution enumeration. In Proceedings of the Sixth Interna- tional Conference on Theory and Applications of Satisfia- bility Testing, pages 272-286. Springer, 2003.","title":"A case for efficient solution enumeration","authors":"Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson","year":"2003","venue":"Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Li et al., 2004] Bin Li, Michael S Hsiao, and Shuo Sheng. A novel SAT all-solutions solver for efficient preimage com- putation. In Proceedings Design, Automation and Test in Europe Conference and Exhibition, volume 1, pages 272- 277. IEEE, 2004.","title":"A novel SAT all-solutions solver for efficient preimage computation","authors":"Bin Li, Michael S Hsiao, Shuo Sheng","year":"2004","venue":"Proceedings Design, Automation and Test in Europe Conference and Exhibition","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Lopes et al., 2013] Nuno P. Lopes, Nikolaj Bjørner, Patrice Godefroid, and George Varghese. Network verification in the light of program verification. MSR, Rep, 2013.","title":"Network verification in the light of program verification","authors":"P Nuno, Nikolaj Lopes, Patrice Bjørner, George Godefroid, Varghese","year":"2013","venue":"MSR","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[McMillan, 2002] Ken L. McMillan. Applying SAT methods in unbounded symbolic model checking. In International Conference on Computer Aided Verification, pages 250- 264. Springer, 2002.","title":"Applying SAT methods in unbounded symbolic model checking","authors":"Ken L Mcmillan","year":"2002","venue":"International Conference on Computer Aided Verification","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Morgado and Marques-Silva, 2005] António Morgado and Joao Marques-Silva. Good learning and implicit model enumeration. In Proceedings of the 17th IEEE Inter- national Conference on Tools with Artificial Intelligence, pages 6-136. IEEE, 2005.","title":"António Morgado and Joao Marques-Silva. Good learning and implicit model enumeration","authors":"Marques-Silva Morgado","year":"2005","venue":"Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Moskewicz et al., 2001] Matthew W Moskewicz, Conor F Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proceed- ings of the 38th annual Design Automation Conference, pages 530-535, 2001.","title":"Chaff: Engineering an efficient SAT solver","authors":"Matthew W Moskewicz, Ying Conor F Madigan, Lintao Zhao, Sharad Zhang, Malik","year":"2001","venue":"Proceedings of the 38th annual Design Automation Conference","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Rymon, 1994] Ron Rymon. An se-tree-based prime impli- cant generation algorithm. Annals of Mathematics and Ar- tificial Intelligence, 11(1):351-365, 1994.","title":"Ron Rymon. An se-tree-based prime implicant generation algorithm","authors":"Rymon","year":"1994","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Sang et al., 2004] Tian Sang, Fahiem Bacchus, Paul Beame, Henry A Kautz, and Toniann Pitassi. Combining com- ponent caching and clause learning for effective model counting. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, pages 20-28. Springer, 2004.","title":"Combining component caching and clause learning for effective model counting","authors":"Tian Sang, Fahiem Bacchus, Paul Beame, Henry A Kautz, Toniann Pitassi","year":"2004","venue":"Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Sang et al., 2005] Tian Sang, Paul Beame, and Henry Kautz. Heuristics for fast exact model counting. In Pro- ceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing, pages 226-240. Springer, 2005.","title":"Heuristics for fast exact model counting","authors":"Tian Sang, Paul Beame, Henry Kautz","year":"2005","venue":"Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Sharma et al., 2019] Shubham Sharma, Subhajit Roy, Mate Soos, and Kuldeep S. Meel. Ganak: A scalable proba- bilistic exact model counter. In IJCAI, volume 19, pages 1169-1176, 2019.","title":"Ganak: A scalable probabilistic exact model counter","authors":"Shubham Sharma, Subhajit Roy, Mate Soos, Kuldeep S Meel","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/163"},{"position":16,"raw":"[Thurley, 2006] Marc Thurley. SharpSAT-counting models with advanced component caching and implicit BCP. In Proceedings of the Ninth International Conference on The- ory and Applications of Satisfiability Testing, pages 424- 429. Springer, 2006.","title":"SharpSAT-counting models with advanced component caching and implicit BCP","authors":"Marc Thurley","year":"2006","venue":"Proceedings of the Ninth International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Toda and Inoue, 2017] Takahisa Toda and Takeru Inoue. Exploiting functional dependencies of variables in all so- lutions SAT solvers. Journal of Information Processing, 25:459-468, 2017.","title":"Exploiting functional dependencies of variables in all solutions SAT solvers","authors":"Inoue ; ] Takahisa Toda, Takeru Toda, Inoue","year":"2017","venue":"Journal of Information Processing","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Toda and Soh, 2016] Takahisa Toda and Takehide Soh. Im- plementing efficient all solutions sat solvers. Journal of Experimental Algorithmics, 21:1-44, November 2016.","title":"Implementing efficient all solutions sat solvers","authors":"Soh Toda, Takahisa Toda, Takehide Soh","year":"2016","venue":"Journal of Experimental Algorithmics","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Yu et al., 2014] Yinlei Yu, Pramod Subramanyan, Nestan Tsiskaridze, and Sharad Malik. All-SAT using minimal blocking clauses. In 2014 27th International Conference on VLSI Design and 2014 13th International Conference on Embedded Systems, pages 86-91. IEEE, 2014.","title":"All-SAT using minimal blocking clauses","authors":"Yu","year":"2014","venue":"27th International Conference on VLSI Design and 2014 13th International Conference on Embedded Systems","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Zhang et al., 2001] Lintao Zhang, Conor F Madigan, Matthew H Moskewicz, and Sharad Malik. Efficient con- flict driven learning in a boolean satisfiability solver. In Proceedings of the 2001 IEEE/ACM International Confer- ence on Computer-Aided Design, pages 279-285. IEEE, 2001.","title":"Efficient conflict driven learning in a boolean satisfiability solver","authors":"Lintao Zhang, Matthew H Conor F Madigan, Sharad Moskewicz, Malik","year":"2001","venue":"Proceedings of the 2001 IEEE/ACM International Conference on Computer-Aided Design","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Zhang et al., 2020a] Yueling Zhang, Geguang Pu, and Jun Sun. Accelerating All-SAT computation with short block- ing clauses. In Proceedings of the 35th IEEE/ACM Inter- national Conference on Automated Software Engineering, pages 6-17, 2020.","title":"Accelerating All-SAT computation with short blocking clauses","authors":"Zhang","year":"2020","venue":"Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Zhang et al., 2020b] Yueling Zhang, Min Zhang, and Geguang Pu. Optimizing backbone filtering. Science of Computer Programming, 187:102374, 2020.","title":"Optimizing backbone filtering","authors":"Zhang","year":"2020","venue":"Science of Computer Programming","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Zhou et al., 2021] Junping Zhou, Chumin Li, Yupeng Zhou, Mingyang Li, Lili Liang, and Jianan Wang. Solving diver- sified top-k weight clique search problem. Science China Information Sciences, 64:150105, 2021.","title":"Solving diversified top-k weight clique search problem","authors":"Junping Zhou, Chumin Li, Yupeng Zhou, Mingyang Li, Lili Liang, Jianan Wang","year":"2021","venue":"Science China Information Sciences","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}