{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:10Z","timestamp":1750308190288,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,7]],"date-time":"2004-06-07T00:00:00Z","timestamp":1086566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,7]]},"DOI":"10.1145\/996566.996710","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"518-523","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":58,"title":["AMUSE"],"prefix":"10.1145","author":[{"given":"Yoonna","family":"Oh","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"Maher N.","family":"Mneimneh","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"Zaher S.","family":"Andraus","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"Karem A.","family":"Sakallah","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"Igor L.","family":"Markov","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]}],"member":"320","published-online":{"date-parts":[[2004,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90060-9"},{"key":"e_1_3_2_1_2_1","volume-title":"Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae,\" in Electronic Notes in Discrete Mathematics","author":"Bruni R.","year":"2001","unstructured":"R. Bruni and A. Sassano , \" Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae,\" in Electronic Notes in Discrete Mathematics , vol. 9 , 2001 . R. Bruni and A. Sassano, \"Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae,\" in Electronic Notes in Discrete Mathematics, vol. 9, 2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018924526592"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00337-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00245-6"},{"key":"e_1_3_2_1_6_1","volume-title":"An Extensible SAT-solver,\" in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT)","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n , and N. S\u00f6rensson , \" An Extensible SAT-solver,\" in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT) , 2003 . N. E\u00e9n, and N. S\u00f6rensson, \"An Extensible SAT-solver,\" in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT), 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking: An Approach to the State Explosion Problem","author":"McMillan K. L.","year":"1993","unstructured":"K. L. McMillan , Symbolic Model Checking: An Approach to the State Explosion Problem , Kluwer Academic Publishers , 1993 . K. L. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem, Kluwer Academic Publishers, 1993."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/369691.369777"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90042-6"},{"key":"e_1_3_2_1_11_1","unstructured":"SAT benchmarks from Automotive Product Configuration http:\/\/www-sr.informatik.uni-tuebingen.de\/sinz\/DC\/  SAT benchmarks from Automotive Product Configuration http:\/\/www-sr.informatik.uni-tuebingen.de\/sinz\/DC\/"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060403171065"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379019"},{"key":"e_1_3_2_1_14_1","first-page":"279","author":"Zhang L.","year":"2001","unstructured":"L. Zhang , C. Madigan , M. Moskewicz , and S. Malik , \"Efficient Conflict Driven Learning in a Boolean Satisfiability Solver,\" in Proceedings of the International Conference on Computer-Aided Design , pp. 279 -- 285 , 2001 . L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, \"Efficient Conflict Driven Learning in a Boolean Satisfiability Solver,\" in Proceedings of the International Conference on Computer-Aided Design, pp. 279--285, 2001.","journal-title":"\"Efficient Conflict Driven Learning in a Boolean Satisfiability Solver,\" in Proceedings of the International Conference on Computer-Aided Design"},{"key":"e_1_3_2_1_15_1","volume-title":"Margherita Ligure - Portofino","author":"Zhang L.","year":"2003","unstructured":"L. Zhang and S. Malik , \" Extracting Small Unsatisfiable Cores from Unsatisfiable Boolean Formula,\" presented at Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), S . Margherita Ligure - Portofino , Italy , 2003 . L. Zhang and S. Malik, \"Extracting Small Unsatisfiable Cores from Unsatisfiable Boolean Formula,\" presented at Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), S. Margherita Ligure - Portofino, Italy, 2003."}],"event":{"name":"DAC04: The 41st Annual Design Automation Conference 2004","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"location":"San Diego CA USA","acronym":"DAC04"},"container-title":["Proceedings of the 41st annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/996566.996710","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/996566.996710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:24:44Z","timestamp":1750263884000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/996566.996710"}},"subtitle":["a minimally-unsatisfiable subformula extractor"],"short-title":[],"issued":{"date-parts":[[2004,6,7]]},"references-count":15,"alternative-id":["10.1145\/996566.996710","10.1145\/996566"],"URL":"https:\/\/doi.org\/10.1145\/996566.996710","relation":{},"subject":[],"published":{"date-parts":[[2004,6,7]]},"assertion":[{"value":"2004-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}