Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [10] can be solved in seconds on commodity PCs. More recent benchmarks take longer to solve because of their large size, but are still...
Uloženo v:
| Vydáno v: | Annual ACM IEEE Design Automation Conference: Proceedings of the 39th conference on Design automation : New Orleans, Louisiana, USA; 10-14 June 2002 s. 731 - 736 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY, USA
ACM
10.06.2002
|
| Edice: | ACM Conferences |
| Témata: | |
| ISBN: | 1581134614, 9781581134612 |
| 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 | Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [10] can be solved in seconds on commodity PCs. More recent benchmarks take longer to solve because of their large size, but are still solved in minutes [25]. Yet, small and difficult SAT instances must exist because Boolean satisfiability is NP-complete.We propose an improved construction of symmetry-breaking clauses [9] and apply it to achieve significant speed-ups over current state-of-the-art in Boolean satisfiability. Our techniques are formulated as pre-processing and can be applied to any SAT solver without changing its source code. We also show that considerations of symmetry may lead to more efficient reductions to SAT in the routing domain.Our work articulates SAT instances that are unusually difficult for their size, including satisfiable instances derived from routing problems. Using an efficient implementation to solve the graph automorphism problem [18, 20, 22], we show that in structured SAT instances difficulty may be associated with large numbers of symmetries. |
|---|---|
| AbstractList | Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [10] can be solved in seconds on commodity PCs. More recent benchmarks take longer to solve because of their large size, but are still solved in minutes [25]. Yet, small and difficult SAT instances must exist because Boolean satisfiability is NP-complete.We propose an improved construction of symmetry-breaking clauses [9] and apply it to achieve significant speed-ups over current state-of-the-art in Boolean satisfiability. Our techniques are formulated as pre-processing and can be applied to any SAT solver without changing its source code. We also show that considerations of symmetry may lead to more efficient reductions to SAT in the routing domain.Our work articulates SAT instances that are unusually difficult for their size, including satisfiable instances derived from routing problems. Using an efficient implementation to solve the graph automorphism problem [18, 20, 22], we show that in structured SAT instances difficulty may be associated with large numbers of symmetries. |
| Author | Sakallah, Karem A. Markov, Igor L. Ramani, Arathi Aloul, Fadi A. |
| Author_xml | – sequence: 1 givenname: Fadi A. surname: Aloul fullname: Aloul, Fadi A. organization: University of Michigan, Ann Arbor – sequence: 2 givenname: Arathi surname: Ramani fullname: Ramani, Arathi organization: University of Michigan, Ann Arbor – sequence: 3 givenname: Igor L. surname: Markov fullname: Markov, Igor L. organization: University of Michigan, Ann Arbor – sequence: 4 givenname: Karem A. surname: Sakallah fullname: Sakallah, Karem A. organization: University of Michigan, Ann Arbor |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15876795$$DView record in Pascal Francis |
| BookMark | eNqNkEtLAzEURgNWsK1dup-NrpyaO3lMgqtSfEHBRSu4C0km0eg8ajIV-u8dacGtd3MvH4cP7pmgUdu1DqELwHMAym4YEAlizoACLk7QBJgAIJQDHaExLonIAePXMzRL6QMPwzCXJR-j23VXf4f2LauC98Hu6j5bLzZZaFOvW-vScGX9u8u20SU3BFnns7RvGtfH_Tk69bpObnbcU_Ryf7dZPuar54en5WKV64KyPi-tqLAghmlsBKdWysow4IWTxjrKtCOFr3xphOAVBitMSYBWRmLHqbdQkCm6OvRuY_e1c6lXTUjW1bVuXbdLigBjshBiAC-PoE5W1z4OL4SktjE0Ou7V4KTkpWR_hdo2ynTdZ1KA1a9HdfCoDh4H8PpfoDIxOE9-AD0-ccs |
| ContentType | Conference Proceeding |
| Copyright | 2002 ACM 2004 INIST-CNRS |
| Copyright_xml | – notice: 2002 ACM – notice: 2004 INIST-CNRS |
| DBID | IQODW 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1145/513918.514102 |
| DatabaseName | Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering |
| EndPage | 736 |
| ExternalDocumentID | 15876795 |
| Genre | Conference Paper |
| GroupedDBID | 6IE 6IH 6IK 6IL AAJGR AAVQY ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IERZE OCL RIB RIC RIE RIL RIO AAWTH IQODW LHSKQ 6IM 6IN 7SC 8FD ACGFS ADZIZ CHZPO IPLJI JQ2 L7M L~C L~D RNS |
| ID | FETCH-LOGICAL-a245t-7c8d083b5a0b864c99db5162e9bce45ae32fdf7b886d01c8b7314db90e64fc123 |
| ISBN | 1581134614 9781581134612 |
| ISICitedReferencesCount | 54 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000177213300128&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 | Fri Sep 05 11:14:13 EDT 2025 Wed Apr 02 07:25:25 EDT 2025 Wed Jan 31 06:44:12 EST 2024 Wed Jan 31 06:47:40 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | faster search instances symmetry speed-up SAT difficult CNF |
| 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 CC BY 4.0 |
| LinkModel | OpenURL |
| MeetingName | DAC02: 39th Design Automation Conference |
| MergedId | FETCHMERGED-LOGICAL-a245t-7c8d083b5a0b864c99db5162e9bce45ae32fdf7b886d01c8b7314db90e64fc123 |
| Notes | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| PQID | 31559288 |
| PQPubID | 23500 |
| PageCount | 6 |
| ParticipantIDs | acm_books_10_1145_513918_514102 pascalfrancis_primary_15876795 acm_books_10_1145_513918_514102_brief proquest_miscellaneous_31559288 |
| PublicationCentury | 2000 |
| PublicationDate | 20020610 |
| PublicationDateYYYYMMDD | 2002-06-10 |
| PublicationDate_xml | – month: 06 year: 2002 text: 20020610 day: 10 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA – name: New York NY |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | Annual ACM IEEE Design Automation Conference: Proceedings of the 39th conference on Design automation : New Orleans, Louisiana, USA; 10-14 June 2002 |
| PublicationYear | 2002 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0000506976 ssj0004161 |
| Score | 1.8753182 |
| Snippet | Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts. Most of the classic DIMACS... |
| SourceID | proquest pascalfrancis acm |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 731 |
| SubjectTerms | Applied sciences Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms -- Algebraic algorithms Electronics Exact sciences and technology Integrated circuits Integrated circuits by function (including memories and processors) Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices |
| Title | Solving difficult SAT instances in the presence of symmetry |
| URI | https://www.proquest.com/docview/31559288 |
| WOSCitedRecordID | wos000177213300128&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/eLvHCXMwtV1Lb9NAEF5BxYEbiCLCo_gAp8jFa-_L6ikCKg5tVSkB9Wbty1C1tiPbqcq_7-z6lUCligMXy14l62S-8c549psZhD4YLrFJXeSeSeGKarMQniITWsN0rpnRyhNkf5zwszNxcZGe91TexrcT4GUpbm_T9X-FGsYAbJc6-w9wj5PCAJwD6HAE2OH4h0d8r_E5HwebYf8_SX3-mi-k_8UzNuaLTVt1SYtbOX_b6rOsrn2owTVQ8eU55svFyjHXW6cmzUCPXPvsJe0DD83vorDtRCteXFcbH2A-luZyvjictpSKrpHUfFE77uMUFK-vqhu_aP2s6vnJ-IWlvHLh_l9D8loxTObkaRtQp9Otf7EbyIgd4aqntHaqdzq922IqME4Iw2RrceW9vbD9FbvfBBBXLYOCZ4vFIXU0VrDQjznHXXLfGICLaMTAF3PJfuPN-hpgw3U8FGUl9NPOhM6V0YXj0coGHqW864Hylzn3PsrqGdqfZBBMWvAcPbLlC3TUAxqMgAYAaDACCmcBABoMgAZVHgyA7qPvx19Xn7-FfeOMUMaEtiHXwoBrraiMlGBEp6lRFLPYpkpbQqVN4tzkXAnBTIS1UCBZYlQaWUZyDb7MS7RXVqV9hQKwyzxRGt7yk5yohCrMIpLoRMtcJji3M_QeJJE5_W-yLsmdZp2ssk5WM_TxgU9kCpQln6GDHWlm667cSgZwcMZTCrcaxJvBGug2tmRpq02TJW5vPRbi9YM_5g16OqneW7TX1hv7Dj3RN-1lUx94BbkDictz6g |
| linkProvider | IEEE |
| 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+39th+annual+Design+Automation+Conference&rft.atitle=Solving+difficult+SAT+instances+in+the+presence+of+symmetry&rft.au=Aloul%2C+Fadi+A.&rft.au=Ramani%2C+Arathi&rft.au=Markov%2C+Igor+L.&rft.au=Sakallah%2C+Karem+A.&rft.series=ACM+Conferences&rft.date=2002-06-10&rft.pub=ACM&rft.isbn=1581134614&rft.spage=731&rft.epage=736&rft_id=info:doi/10.1145%2F513918.514102 |
| 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 |