{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:01:56Z","timestamp":1763535716683,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.23919\/date48585.2020.9116276","type":"proceedings-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T23:28:37Z","timestamp":1592263717000},"page":"654-657","source":"Crossref","is-referenced-by-count":8,"title":["From DRUP to PAC and Back"],"prefix":"10.23919","author":[{"given":"Daniela","family":"Kaufmann","sequence":"first","affiliation":[]},{"given":"Armin","family":"Biere","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Kauers","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Proofs for Satisfiability Problems","volume":"55","author":"heule","year":"2015","journal-title":"All about Proofs Proofs for All"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.12.3500"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2015.0399"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2019.8894250"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317898"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96145-3_32"},{"key":"ref16","first-page":"61","article-title":"A Practical Polynomial Calculus for Arithmetic Circuit Verification","author":"ritirc","year":"2018","journal-title":"SC-Square Workshop 2018"},{"key":"ref17","first-page":"169","article-title":"Equivalence checking using Grobner bases","author":"sayed-ahmed","year":"2016","journal-title":"FMCAD"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_31"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2912944"},{"key":"ref3","article-title":"AIGER 1.9 And Beyond","author":"biere","year":"2011","journal-title":"Technical Report"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-018-9490-4"},{"journal-title":"Ideals Varieties and Algorithms","year":"1997","author":"cox","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-012-9322-x"},{"key":"ref7","article-title":"Verifying RUP proofs of propositional unsatisfiability","author":"gelder","year":"2008","journal-title":"ISAIM"},{"journal-title":"CaDiCaL at the SAT Race 2019","year":"2019","author":"biere","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190039"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2013.6679408"}],"event":{"name":"2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)","start":{"date-parts":[[2020,3,9]]},"location":"Grenoble, France","end":{"date-parts":[[2020,3,13]]}},"container-title":["2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9112295\/9116186\/09116276.pdf?arnumber=9116276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T22:43:38Z","timestamp":1594680218000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9116276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":18,"URL":"https:\/\/doi.org\/10.23919\/date48585.2020.9116276","relation":{},"subject":[],"published":{"date-parts":[[2020,3]]}}}