Chaff engineering an efficient SAT solver
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well...
Uloženo v:
| Vydáno v: | Design Automation, 2001 Proceedings s. 530 - 535 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY, USA
ACM
01.01.2001
IEEE |
| Edice: | ACM Conferences |
| Témata: | |
| ISBN: | 1581132972, 9781581132977 |
| ISSN: | 0738-100X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well as in Artificial Intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development of a new complete solver, Chaff, which achieves significant performance gains through careful engineering of all aspects of the search - especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy. Chaff has been able to obtain one to two orders of magnitude performance improvement on difficult SAT benchmarks in comparison with other solvers (DP or otherwise), including GRASP and SATO. |
|---|---|
| AbstractList | Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well as in Artificial Intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development of a new complete solver, Chaff, which achieves significant performance gains through careful engineering of all aspects of the search - especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy. Chaff has been able to obtain one to two orders of magnitude performance improvement on difficult SAT benchmarks in comparison with other solvers (DP or otherwise), including GRASP and SATO. Boolean satisfiability is probably the most studied of the combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in electronic design automation (EDA), as well as in artificial intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development of a new complete solver, Chaff which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy. Chaff has been able to obtain one to two orders of magnitude performance improvement on difficult SAT benchmarks in comparison with other solvers (DP or otherwise), including GRASP and SATO. |
| Author | Zhang, Lintao Madigan, Conor F. Moskewicz, Matthew W. Malik, Sharad Zhao, Ying |
| Author_xml | – sequence: 1 givenname: Matthew W. surname: Moskewicz fullname: Moskewicz, Matthew W. organization: Department of EECS, UC Berkeley – sequence: 2 givenname: Conor F. surname: Madigan fullname: Madigan, Conor F. organization: Department of EECS, MIT – sequence: 3 givenname: Ying surname: Zhao fullname: Zhao, Ying organization: Department of Electrical Engineering, Princeton University – sequence: 4 givenname: Lintao surname: Zhang fullname: Zhang, Lintao organization: Department of Electrical Engineering, Princeton University – sequence: 5 givenname: Sharad surname: Malik fullname: Malik, Sharad organization: Department of Electrical Engineering, Princeton University |
| BookMark | eNqNj71Ow0AQhFcikUhCShoegAqH29v7LZEFASkSTSLRne7Oe8JAYmTT8PYYmQdgmilmNJpvCbNTd2KASxQbRKVvyTpJfkPWC7RnsETtEEl6K2ewEJZchUK8nMN6GN7EKC2Mt3oB8_o1lnIB8xI_Bl7_-QoOD_f7-rHaPW-f6rtdFaXFr0qr7CVnSaVJipO0OQnplFTCsY3ZJZOw4awbRSVzNLq4bFLhhOMrV4hWcDXttswcPvv2GPvv4Elro8fwZgpjPobUde9DQBF-6cJEFya6kPqWy1i__ledfgAS70yw |
| ContentType | Conference Proceeding |
| Copyright | 2001 ACM |
| Copyright_xml | – notice: 2001 ACM |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1145/378239.379017 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEL url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 535 |
| ExternalDocumentID | 935565 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH 6IK 6IL AAJGR AAVQY AAWTH ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IERZE LHSKQ OCL RIE RIL RIO 123 29O 6IF 6IM 6IN ACGFS ADZIZ CHZPO IEGSK IJVOP IPLJI M43 RNS |
| ID | FETCH-LOGICAL-a271t-54c92ec23fdb4eb27cb02842408e7ac8b6b1dec5d43fcea65f8c6bfeb19018f33 |
| IEDL.DBID | RIE |
| ISBN | 1581132972 9781581132977 |
| ISICitedReferencesCount | 1437 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000171225800095&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0738-100X |
| IngestDate | Wed Aug 27 02:15:33 EDT 2025 Wed Jan 31 06:47:05 EST 2024 Wed Jan 08 03:35:50 EST 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | boolean satisfiability design verification |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | DirectLink |
| MeetingName | DAC01: 38th ACM/IEEE-CAS/ EDAC Design Automation Conference |
| MergedId | FETCHMERGED-LOGICAL-a271t-54c92ec23fdb4eb27cb02842408e7ac8b6b1dec5d43fcea65f8c6bfeb19018f33 |
| PageCount | 6 |
| ParticipantIDs | acm_books_10_1145_378239_379017_brief ieee_primary_935565 acm_books_10_1145_378239_379017 |
| PublicationCentury | 2000 |
| PublicationDate | 2001-01-01 |
| PublicationDateYYYYMMDD | 2001-01-01 |
| PublicationDate_xml | – month: 01 year: 2001 text: 2001-01-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | Design Automation, 2001 Proceedings |
| PublicationTitleAbbrev | DAC |
| PublicationYear | 2001 |
| Publisher | ACM IEEE |
| Publisher_xml | – name: ACM – name: IEEE |
| SSID | ssj0000506975 ssj0004161 |
| Score | 2.292984 |
| Snippet | Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide... Boolean satisfiability is probably the most studied of the combinatorial optimization/search problems. Significant effort has been devoted to trying to provide... |
| SourceID | ieee acm |
| SourceType | Publisher |
| StartPage | 530 |
| SubjectTerms | Applied computing -- Physical sciences and engineering -- Engineering Artificial intelligence Business continuity Computer systems organization -- Dependable and fault-tolerant systems and networks Design automation Design engineering Electronic design automation and methodology Electronics packaging General and reference -- Cross-computing tools and techniques -- Performance Hardware -- Robustness Logic testing Networks -- Network performance evaluation NP-complete problem Performance gain Permission Theory of computation -- Computational complexity and cryptography -- Interactive proof systems Theory of computation -- Computational complexity and cryptography -- Proof complexity Theory of computation -- Logic -- Proof theory |
| Subtitle | engineering an efficient SAT solver |
| Title | Chaff |
| URI | https://ieeexplore.ieee.org/document/935565 |
| WOSCitedRecordID | wos000171225800095&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LS8NAEMcHWzzoRa0V4zMHvQix5rGPeJNi8VQKVugt7G5msQdT6cPP7-ymL0EQIYdkCUvyZ5KZfcxvAG6UFRQWx3FkY7fMiJpFmoa2ESdvrq10xBHpi02Ifl-ORvlgydn2uTCI6Def4b079Wv55cQs3FRZx7HAOWtAQwhRp2qtp1OoU55v8XZd3O4JnKmjlz6MXE4Xk76sukiWqKfVtVixNzPWScljkvmkgvyk91jm40fdFe92egf_euBDaG_S98LB2jEdwQ5WLdjfIg8ew133XVn7GOKmMVRViB4oQX2Gr0_DkMySDL0Nb73nYfclWpZNiFQi4nnEMpMnaJLUlprET4TRFERkjmWGQhmpuY5LNKzMUmtQcWal4drST5veWdo0PYFmNanwFMK4NDGNR1jONc_yMtMiV4q-ckPKSVZiANckUOHGA7OiTnFmRS1hUUsYwO0fdxR6OkYbQMvJV3zWjI2iVu7s19Zz2Kt3grnjAprz6QIvYdd8zcez6ZW3i29m3Ksm |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LS8NAEMcHrYJ6UWvF-moOehFizWMf8SbFUrGWghV6W3Y3u9iDrfTh53d205cgiJBDsoQl-TPJzD7mNwBX0jIMi6MotJFbZjSKhAqHtiFFb64sd8QR7otNsE6H9_tZd87Z9rkwxhi_-czculO_lp-P9MxNldUdC5ySTdgiaRpHRbLWckIFu6XZGnHXRe6ewZk4fuld32V1Ee4Lq7N4DntaXLMFfTMl9QR9JhpQwtBTep-lP35UXvGOp7n_r0c-gMoqgS_oLl3TIWyYYRn21tiDR3DTeJfW3gdm1RjIYWA8UgL7DF4fegEaJpp6Bd6aj71GK5wXTghlzKJpSFKdxUbHic0Vyh8zrTCMSB3NzDCpuaIqyo0meZpYbSQllmuqLP628Z25TZJjKA1HQ3MCQZTrCEckJKOKplmeKpZJid-5RuU4yU0VaiiQcCOCiSiSnIkoJBSFhFW4_uMOocYDY6tQdvKJz4KyIQrlTn9trcFOq_fSFu2nzvMZ7Bb7wtxxDqXpeGYuYFt_TQeT8aW3kW-Iya5t |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+38th+annual+Design+Automation+Conference&rft.atitle=Chaff&rft.au=Moskewicz%2C+Matthew+W.&rft.au=Madigan%2C+Conor+F.&rft.au=Zhao%2C+Ying&rft.au=Zhang%2C+Lintao&rft.series=ACM+Conferences&rft.date=2001-01-01&rft.pub=ACM&rft.isbn=1581132972&rft.spage=530&rft.epage=535&rft_id=info:doi/10.1145%2F378239.379017 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0738-100X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0738-100X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0738-100X&client=summon |