[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-267024-105":59,"doc-detail-267024-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","tassat-transfer-and-share-sat-abstract","TaSSAT - Transfer and Share SAT - Abstract","","TaSSAT is presented as a powerful local search SAT solver designed to handle hard combinatorial instances effectively. The method improves efficiency through a weight-transfer strategy that reallocates clause weights in local minima, allowing better escape behavior. Built on YalSAT, TaSSAT leverages practical enhancements such as restarts and thread parallelization, including a parallel implementation that shares data structures to substantially cut memory usage. Experiments on SAT competition benchmarks show strong performance gains and improved lower bounds for several van der Waerden numbers.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/tassat-transfer-and-share-sat-abstract/267024/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/tassat-transfer-and-share-sat-abstract/267024.png","ImageObject",300,407,{"name":92,"@type":93},"Maeve","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-09-20","2026-09-14",true,{"@type":102,"interactionType":103,"userInteractionCount":81},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What is TaSSAT, and what problem does it target?","Question",{"text":112,"@type":113},"TaSSAT is a local search SAT solver aimed at effectively solving hard combinatorial problems expressed as SAT instances.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How does TaSSAT improve performance when the search reaches local minima?",{"text":117,"@type":113},"It uses a weight-transfer approach that transfers clause weights in local minima, helping the solver escape and become more efficient.",{"name":119,"@type":110,"acceptedAnswer":120},"What role does parallelization play in TaSSAT?",{"text":121,"@type":113},"TaSSAT includes a parallel version that shares data structures across threads, reducing memory usage and improving overall performance on benchmarks.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},267024,1789413999,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":81,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":44,"language":139,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":140,"faqs":141,"seo_title":142,"seo_description":67,"update_tm":129,"read_time":143},5909877438554,"https://ap-avatar.wpscdn.com/avatar/5600025385ad2bf12a7?_k=1778553567797529272","TaSSAT: Transfer and Share SAT⋆  \nMd Solimul Chowdhury(B), Cayden R. Codel, and Marijn J. H. Heule  \nCarnegie Mellon University, Pittsburgh, PA, USA {mdsolimc,ccodel,[mheule](mheule}@cs.cmu.edu)[}](mheule}@cs.cmu.edu)[@cs.cmu.edu](mheule}@cs.cmu.edu)  \nAbstract. We present TaSSAT, a powerful local search SAT solver that effectively solves hard combinatorial problems. Its unique approach of transferring clause weights in local minima enhances its efficiency in solving problem instances. Since it is implemented on top of YalSAT, TaSSAT benefits from practical techniques such as restart strategies and thread parallelization. Our implementation includes a parallel version that shares data structures across threads, leading to a significant reduction in memory usage. Our experiments demonstrate that TaSSAT outperforms similar solvers on a vast set of SAT competition benchmarks. Notably, with the parallel configuration of TaSSAT, we improve lower bounds for several van der Waerden numbers.  \nKeywords: Local Search for SAT · Weight Transfer · Memory Efficiency  \n1 Introduction  \nThe SAT problem asks if there exists a satisfying truth assignment for a given formula in propositional logic. SAT is known to be intractable [11], but modern SAT solvers, particularly conflict-driven clause learning (CDCL) solvers, have made significant progress in solving large formulas from various application domains. When it comes to combinatorial problems, stochastic local search (SLS) solvers are often more effective than CDCL. Because SLS and CDCL solvers have complementary strengths, some SAT solvers like Kissat [7] and CryptoMiniSAT [17] combine SLS and CDCL techniques, and SLS methods play a key role in shaping the capabilities of modern SAT solvers.  \nSLS solvers explore truth assignments by flipping the truth value of individual variables until a solution is found or until timeout. The solver generally tries to flip variables that will minimize the number of falsified clauses. When a solver determines that no variable flip will lead to an improvement according to some heuristic or metric, it has reached a local minimum.  \nTo escape local minima, the solver can either make random flips or adjust its internal state until improvement is possible. Despite being an effective family of algorithms for escaping local minima, Dynamic Local Search (DLS) has attracted  \n⋆ The authors were supported by NSF grant CCF-2229099 . Md Solimul Chowdhury was partially supported by a NSERC Postdoctoral Fellowship.  \n⃝c The Author(s) 2024  \nB. Finkbeiner and L. Kova´cs (Eds.): TACAS 2024, LNCS 14570, pp. 34–42, 2024 .  \n[https://doi.org/10.1007/978-3-031-57246-3](https://doi.org/10.1007/978-3-031-57246-3_3)[_](https://doi.org/10.1007/978-3-031-57246-3_3)[3](https://doi.org/10.1007/978-3-031-57246-3_3)  \nTaSSAT: Transfer and Share SAT 35  \nlimited attention in the recent years. DLS algorithms assign weights to clauses, search to find a solution by minimizing the total amount of weight held by falsified clauses, and adjust these weights in local minima as a means of escaping them.  \nThe tool we present in this paper is ultimately based on DDFW [16] (divide and distribute fixed weights), a DLS algorithm that dynamically transfers weight from satisfied to falsified clauses along neighborhood relationships in local minima. DDFW is remarkably effective at solving hard combinatorial problems, such as matrix multiplication [14], graph coloring [13], edge matching [12], the coloring of the Pythagorean triples [15], and finding bounds for van der Waerden numbers [3] . Notably, DDFW solves satisfiable instances of the Pythagorean triples problem in under a minute, whereas CDCL solvers take CPU years.  \nIn this paper, we introduce Transfer and Share SAT (TaSSAT), a novel parallel SLS solver. TaSSAT implements LiWeT, a simplification of the algorithm from our recent work [10] modifying DDFW. Our implementation of TaSSAT is built on top of a leading SLS solver YalSAT [5], and it adds two new features. First","cbCaiemR1EkPtbGD","https://ap.wps.com/l/cbCaiemR1EkPtbGD","pdf",754175,"English","# Abstract\n# 1 Introduction\n# 2 Preliminaries\n## SAT and CNF basics\n## Dynamic Local Search and clause weights\n## DDFW workflow and local minima","[{\"question\":\"What is TaSSAT, and what problem does it target?\",\"answer\":\"TaSSAT is a local search SAT solver aimed at effectively solving hard combinatorial problems expressed as SAT instances.\"},{\"question\":\"How does TaSSAT improve performance when the search reaches local minima?\",\"answer\":\"It uses a weight-transfer approach that transfers clause weights in local minima, helping the solver escape and become more efficient.\"},{\"question\":\"What role does parallelization play in TaSSAT?\",\"answer\":\"TaSSAT includes a parallel version that shares data structures across threads, reducing memory usage and improving overall performance on benchmarks.\"}]","TaSSAT - Transfer and Share SAT - Abstract | PDF",23]