{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/improving-sat-solvers-via-blocked-clause","title":"Improving SAT Solvers via Blocked Clause Decomposition","arxiv_id":"1604.00536","date":"2016-04-02","proceeding":null,"authors":["Jingchao Chen"],"abstract":"The decision variable selection policy used by the most competitive CDCL\n(Conflict-Driven Clause Learning) SAT solvers is either VSIDS (Variable State\nIndependent Decaying Sum) or its variants such as exponential version EVSIDS.\nThe common characteristic of VSIDS and its variants is to make use of\nstatistical information in the solving process, but ignore structure\ninformation of the problem. For this reason, this paper modifies the decision\nvariable selection policy, and presents a SAT solving technique based on BCD\n(Blocked Clause Decomposition). Its basic idea is that a part of decision\nvariables are selected by VSIDS heuristic, while another part of decision\nvariables are selected by blocked sets that are obtained by BCD. Compared with\nthe existing BCD-based technique, our technique is simple, and need not to\nreencode CNF formulas. SAT solvers for certified UNSAT track can apply also our\nBCD-based technique. Our experiments on application benchmarks demonstrate that\nthe new variables selection policy based on BCD can increase the performance of\nSAT solvers such as abcdSAT. The solver with BCD solved an instance from the\nSAT Race 2015 that was not solved by any solver so far. This shows that in some\ncases, the heuristic based on structure information is more efficient than that\nbased on statistical information.","url_abs":"http://arxiv.org/abs/1604.00536v1","url_pdf":"http://arxiv.org/pdf/1604.00536v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"improving-sat-solvers-via-blocked-clause","repo_url":"https://github.com/jingchaochen/MixBcd","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"variable-selection","task_name":"Variable Selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}