AMUSE a minimally-unsatisfiable subformula extractor
This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula. Such unsatisfiable "cores" can be very helpful in diagnosing the causes of infeasibility in large systems. Our algorithm is unique in that it adapts the "learning proc...
Uložené v:
| Vydané v: | 2004 41st Conference Design Automation s. 518 - 523 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY, USA
ACM
07.06.2004
IEEE Association for Computing Machinery |
| Edícia: | ACM Conferences |
| Predmet: | |
| ISBN: | 1581138288, 9781581138283, 1511838288 |
| ISSN: | 0738-100X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula. Such unsatisfiable "cores" can be very helpful in diagnosing the causes of infeasibility in large systems. Our algorithm is unique in that it adapts the "learning process" of a modern SAT solver to identify unsatisfiable subformulas rather than search for satisfying assignments. Compared to existing approaches, this method can be viewed as a bottom-up core extraction procedure which can be very competitive when the core sizes are much smaller than the original formula size. Repeated runs of the algorithm with different branching orders yield different cores. We present experimental results on a suite of large automotive benchmarks showing the performance of the algorithm and highlighting its ability to locate not just one but several cores. |
|---|---|
| AbstractList | This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula. Such unsatisfiable "cores" can be very helpful in diagnosing the causes of infeasibility in large systems. Our algorithm is unique in that it adapts the "learning process" of a modern SAT solver to identify unsatisfiable subformulas rather than search for satisfying assignments. Compared to existing approaches, this method can be viewed as a bottom-up core extraction procedure which can be very competitive when the core sizes are much smaller than the original formula size. Repeated runs of the algorithm with different branching orders yield different cores. We present experimental results on a suite of large automotive benchmarks showing the performance of the algorithm and highlighting its ability to locate not just one but several cores. |
| Author | Sakallah, Karem A. Markov, Igor L. Oh, Yoonna Andraus, Zaher S. Mneimneh, Maher N. |
| Author_xml | – sequence: 1 givenname: Yoonna surname: Oh fullname: Oh, Yoonna organization: University of Michigan, Ann Arbor, MI – sequence: 2 givenname: Maher N. surname: Mneimneh fullname: Mneimneh, Maher N. organization: University of Michigan, Ann Arbor, MI – sequence: 3 givenname: Zaher S. surname: Andraus fullname: Andraus, Zaher S. organization: University of Michigan, Ann Arbor, MI – sequence: 4 givenname: Karem A. surname: Sakallah fullname: Sakallah, Karem A. organization: University of Michigan, Ann Arbor, MI – sequence: 5 givenname: Igor L. surname: Markov fullname: Markov, Igor L. organization: University of Michigan, Ann Arbor, MI |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17345524$$DView record in Pascal Francis |
| BookMark | eNqNkE1LAzEQhgO2YFt79ORZT27NZDKb7LGUVoWKBy14C9lsFlb3o27ag__eyBZ6dS4vzPswA8-Ujdqu9YxdA18ASHrIspTSdBFDAb9gUyANgFpoPWITrlAnwPnHJZuH8MnjKJUpiRM2Xr7s3tZXbFzaOvj5KWdst1m_r56S7evj82q5TSxycUhyAuLaZdwWziGXhcszp9GhyHThJUlZWBE3VGpB3qclaCytBlJCknaEM3Y33N333ffRh4NpquB8XdvWd8dgEBA4Kozg7Qm0wdm67G3rqmD2fdXY_seAQkkkZORuBq7y3p9rFIIwPb-zrjF5130FA9z8-TKDLzP4iuD9v0CT95Uv8Rfwr2Vn |
| ContentType | Conference Proceeding |
| Copyright | 2004 ACM 2006 INIST-CNRS |
| Copyright_xml | – notice: 2004 ACM – notice: 2006 INIST-CNRS |
| DBID | 6IE 6IH CBEJK RIE RIO IQODW 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1145/996566.996710 |
| 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 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 |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore Digital Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EndPage | 523 |
| ExternalDocumentID | 17345524 1322536 |
| Genre | orig-research Conference Paper |
| GroupedDBID | 6IE 6IH 6IK 6IL AAJGR AAVQY ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI OCL RIE RIL RIO 123 29O 6IF 6IM 6IN AAWTH ACGFS ADZIZ CHZPO IEGSK IJVOP IPLJI M43 RNS AAKMM IQODW 7SC 8FD JQ2 L7M LHSKQ L~C L~D |
| ID | FETCH-LOGICAL-a302t-b51508c90adcc304dcb9c83c3298de4544da29c85f825ee6f183fa81572458c53 |
| IEDL.DBID | RIE |
| ISBN | 1581138288 9781581138283 1511838288 |
| ISICitedReferencesCount | 60 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000223078800111&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 Jul 11 02:32:30 EDT 2025 Sun Oct 22 16:09:13 EDT 2023 Tue Aug 26 18:32:43 EDT 2025 Wed Jan 31 06:48:08 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | diagnosis boolean satisfiability (SAT) minimally-unsatisfiable subformula (MUS) conjunctive normal form (CNF) Learning Circuit design Algorithm performance Algorithm Computer aided design Large scale system |
| 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 | DirectLink |
| MeetingName | DAC04: The 41st Annual Design Automation Conference 2004 |
| MergedId | FETCHMERGED-LOGICAL-a302t-b51508c90adcc304dcb9c83c3298de4544da29c85f825ee6f183fa81572458c53 |
| Notes | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| PQID | 31310373 |
| PQPubID | 23500 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_1322536 acm_books_10_1145_996566_996710_brief proquest_miscellaneous_31310373 pascalfrancis_primary_17345524 acm_books_10_1145_996566_996710 |
| PublicationCentury | 2000 |
| PublicationDate | 20040607 20040000 2004 20040601 |
| PublicationDateYYYYMMDD | 2004-06-07 2004-01-01 2004-06-01 |
| PublicationDate_xml | – month: 06 year: 2004 text: 20040607 day: 07 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA – name: New York NY – name: Piscataway NJ |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | 2004 41st Conference Design Automation |
| PublicationTitleAbbrev | DAC |
| PublicationYear | 2004 |
| Publisher | ACM IEEE Association for Computing Machinery |
| Publisher_xml | – name: ACM – name: IEEE – name: Association for Computing Machinery |
| SSID | ssj0000779743 ssj0004161 |
| Score | 1.8900986 |
| Snippet | This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula. Such unsatisfiable "cores" can be very... This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula. Such unsatisfiable 'cores' can be very... |
| SourceID | proquest pascalfrancis ieee acm |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 518 |
| SubjectTerms | Applied sciences Automotive engineering Boolean functions Combinatorial mathematics Computer bugs Design. Technologies. Operation analysis. Testing Electronic design automation and methodology Electronics Exact sciences and technology Field programmable gate arrays Hardware Integrated circuits Mathematics of computing -- Discrete mathematics -- Combinatorics -- Combinatorial algorithms Polynomials Routing Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Wires |
| Subtitle | a minimally-unsatisfiable subformula extractor |
| Title | AMUSE |
| URI | https://ieeexplore.ieee.org/document/1322536 https://www.proquest.com/docview/31310373 |
| WOSCitedRecordID | wos000223078800111&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/eLvHCXMwlV1dS8MwFL244YO--I3zsw_6ZrVtkqX1TUTxQYfgB3sLSZqAsHWyroL_3nvbzSkK4lNLU0o4SZNzk5xzAY6QUQimpQmdj3nIMVAOs1zzMObGSO6Y0bXjzfOt7PXSfj-7X4CTTy2Mc64-fOZO6bbey89HtqKlsjOKnATrtqAlZbfRas01kHHtjYo9luxKoz6JuIg9Mwwp0pm5JhdnyO-RwZziRZJqtqXtcJpYhY5F6hKR8U1Kix-jcz3lXK_8r7KrsDnX7gX3n7PSGiy4Yh2Wv9gOboC4uHt6uDoPdEDGIkM9GLyHVVHWOocXklIFZWWIzFYDHeDgPa5z8mzC0_XV4-VNOE2fEGoWJZPQCPJ6t1mkc2tZxHNrMpsyy5IszR0XnOc6wSfCY5ToXNcjWF6nsZAJF6kVbAvaxahw2xBYDOJMVzuGfJxHuTfeR0IYh9xPYPxiOnCIOCqKC0rVSJ2FapBWDdIdOP7jDWXGL853YIOgVK-N14aaotiBg29tMy-XjAuRcKzBrLEU_iC066ELN6pKxWJKpSbZzu9f3oWl5jAOrarsQXsyrtw-LNo3xHx8UPexDwmfybA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7MC6gv3nFetj7om9W2SdbWNxFl4hyCF_YWkjQBYXayWsF_7zntdIqC-NTSlBK-pMl3knzfAdhHRiGYirVvXch9joGyn2aK-yHXOuaWaVU53jz04n4_GQzSmwYcfmphrLXV4TN7RLfVXn42MiUtlR1T5CRYZwbmBOdRUKu1pirIsHJHxT5LhqXBgGRcxJ8ZBhXJh70mF8fI8JHDHOElJt3sjDJPk9QqdDBSFYiNq5Na_Bifq0nnYvl_1V2Bjal6z7v5nJdWoWHzNVj6Yjy4DuL0-v72_MRTHlmLPKnh8M0v86JSOjySmMorSk10thwqD4fvcZWVZwPuL87vzrr-JIGCr1gQvfhakNu7SQOVGcMCnhmdmoQZFqVJZjmCmKkInwiHcaK1HYdgOZWEIo64SIxgmzCbj3K7BZ7BME53lGXIyHmQOe1cIIS2yP4ERjC6CW3EUVJkUMha7CxkjbSskW7CwR9vSD1-tK4J6wSlfK7dNuQExSa0vrXNtDxmXIiIYw0-GkviL0L7Hiq3o7KQLKRkajHb_v3LbVjo3l33ZO-yf7UDi_XRHFpj2YXZl3Fp92DevCL-41bV394BtsnM9w |
| 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%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+-+ACM+IEEE+Design+Automation+Conference&rft.atitle=AMUSE%3A+a+minimally-unsatisfiable+subformula+extractor&rft.au=Yoonna+Oh&rft.au=Mneimneh%2C+M.N.&rft.au=Andraus%2C+Z.S.&rft.au=Sakallah%2C+K.A.&rft.date=2004-01-01&rft.pub=IEEE&rft.isbn=1511838288&rft.issn=0738-100X&rft.spage=518&rft.epage=523&rft_id=info:doi/10.1145%2F996566.996710&rft.externalDocID=1322536 |
| 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 |