{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:30Z","timestamp":1750306230963,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,11,7]],"date-time":"2016-11-07T00:00:00Z","timestamp":1478476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,11,7]]},"DOI":"10.1145\/2966986.2967040","type":"proceedings-article","created":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T12:23:59Z","timestamp":1476793439000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast generation of lexicographic satisfiable assignments"],"prefix":"10.1145","author":[{"given":"Ana","family":"Petkovska","sequence":"first","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Mishchenko","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Brayton","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Ienne","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The EPFL Combinational Benchmark Suite \"Multi-output PLA benchmarks\". http:\/\/lsi.epfl.ch\/benchmarks."},{"key":"e_1_3_2_1_2_1","unstructured":"Berkeley Logic Synthesis and Verification Group Berkeley Calif. ABC: A System for Sequential Synthesis and Verification. http:\/\/www.eecs.berkeley.edu\/˜alanmi\/abc\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing","volume":"2919","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n and N. S\u00f6rensson. An extensible SAT-solver. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, volume 2919, pages 502--18. Springer, May 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2013.6718374"},{"key":"e_1_3_2_1_5_1","series-title":"The Art of Computer Programming","volume-title":"Satisfiability","author":"Knuth D. E.","year":"2015","unstructured":"D. E. Knuth. Fascicle 6: Satisfiability, volume 19 of The Art of Computer Programming. Addison-Wesley, Reading, Mass., Dec. 2015."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9233-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2023474.2023505"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_53"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 25th International Workshop on Logic and Synthesis","author":"Petkovska A.","year":"2016","unstructured":"A. Petkovska, A. Mishchenko, D. Novo, M. Owaida, and P. Ienne. Progressive generation of canonical sum of products using a SAT solver. In Proceedings of the 25th International Workshop on Logic and Synthesis, Austin, Tex., June 2016."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2016.7428057"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2132325.2132474"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.823348"}],"event":{"name":"ICCAD '16: IEEE\/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CS","IEEE-EDS Electronic Devices Society"],"location":"Austin Texas","acronym":"ICCAD '16"},"container-title":["Proceedings of the 35th International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2966986.2967040","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2966986.2967040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:11Z","timestamp":1750220591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2966986.2967040"}},"subtitle":["Enabling canonicity in SAT-based applications"],"short-title":[],"issued":{"date-parts":[[2016,11,7]]},"references-count":14,"alternative-id":["10.1145\/2966986.2967040","10.1145\/2966986"],"URL":"https:\/\/doi.org\/10.1145\/2966986.2967040","relation":{},"subject":[],"published":{"date-parts":[[2016,11,7]]},"assertion":[{"value":"2016-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}