{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:26:57Z","timestamp":1753885617095,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.23919\/fmcad.2018.8602993","type":"proceedings-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T01:33:52Z","timestamp":1546997632000},"page":"1-9","source":"Crossref","is-referenced-by-count":2,"title":["Complete and Efficient DRAT Proof Checking"],"prefix":"10.23919","author":[{"given":"Adrian","family":"Rebola-Pardo","sequence":"first","affiliation":[]},{"given":"Luis","family":"Cruz-Filipe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"The DRAT format and drat-trim checker","author":"heule","year":"2016","journal-title":"CoRR"},{"year":"2018","author":"heule","journal-title":"Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence New Orleans Louisiana USA February 2-7 2018","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/978-3-319-63046-5_15"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/378239.379017"},{"key":"ref14","first-page":"65","article-title":"Towards a semantics of unsatisfiability proofs with inprocessing","volume":"46","author":"philipp","year":"2017","journal-title":"LPAR"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.29007\/nnqs"},{"key":"ref16","first-page":"422","article-title":"DRAT-trim: Efficient checking and trimming using expressive clausal proofs","volume":"8561","author":"wetzler","year":"2014","journal-title":"SAT"},{"key":"ref4","first-page":"190","article-title":"Fuzzing and verifying RAT refutations with deletion information","author":"forkel","year":"2017","journal-title":"Florida Artificial Intelligence Research Society Conference"},{"key":"ref3","first-page":"502","article-title":"An extensible SAT-solver","volume":"2919","author":"e\u00e9n","year":"2004","journal-title":"SAT"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/DATE.2003.1253718"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/s10472-012-9322-x"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/FMCAD.2013.6679408"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-319-66107-0_18","article-title":"Efficient, verified checking of propositional proofs","volume":"10499","author":"heule","year":"2017","journal-title":"Interactive Theorem Proving"},{"key":"ref2","first-page":"220","article-title":"Efficient certified RAT verification","volume":"10395","author":"cruz-filipe","year":"2017","journal-title":"CADE"},{"key":"ref1","first-page":"5061","article-title":"SAT competition 2016: Recent developments","author":"balyo","year":"2017","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref9","first-page":"345","article-title":"Verifying refutations with extended resolution","volume":"7898","author":"heule","year":"2013","journal-title":"CADE"}],"event":{"name":"2018 Formal Methods in Computer Aided Design (FMCAD)","start":{"date-parts":[[2018,10,30]]},"location":"Austin, TX","end":{"date-parts":[[2018,11,2]]}},"container-title":["2018 Formal Methods in Computer Aided Design (FMCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8585253\/8602989\/08602993.pdf?arnumber=8602993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T22:51:41Z","timestamp":1643151101000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8602993\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.23919\/fmcad.2018.8602993","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}