{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:53:57Z","timestamp":1752674037045,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002347","name":"German Federal Ministry of Education and Research","doi-asserted-by":"publisher","award":["16ME0122K-16ME0140+16ME0465 (Scale4Edge)"],"award-info":[{"award-number":["16ME0122K-16ME0140+16ME0465 (Scale4Edge)"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3174564","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T19:33:35Z","timestamp":1652384015000},"page":"51814-51825","source":"Crossref","is-referenced-by-count":2,"title":["Fast Error Propagation Probability Estimates by Answer Set Programming and Approximate Model Counting"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7095-7551","authenticated-orcid":false,"given":"Anselm","family":"Breitenreiter","sequence":"first","affiliation":[{"name":"IHP—Leibniz-Institut für innovative Mikroelektronik, Frankfurt (Oder), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6419-2062","authenticated-orcid":false,"given":"Marko","family":"Andjelkovic","sequence":"additional","affiliation":[{"name":"IHP—Leibniz-Institut für innovative Mikroelektronik, Frankfurt (Oder), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3513-3239","authenticated-orcid":false,"given":"Oliver","family":"Schrape","sequence":"additional","affiliation":[{"name":"IHP—Leibniz-Institut für innovative Mikroelektronik, Frankfurt (Oder), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0267-0203","authenticated-orcid":false,"given":"Milos","family":"Krstic","sequence":"additional","affiliation":[{"name":"IHP—Leibniz-Institut für innovative Mikroelektronik, Frankfurt (Oder), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2000254"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/DSN-W.2018.00046"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.262"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2014.6865207"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DFTVS.2005.61"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-013-5365-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-017-5640-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IOLTS.2019.8854380"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.microrel.2009.08.006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/NEWCAS.2017.8010149"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v33i1.2395"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.49"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1297666.1297674"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ETC.1989.36234"},{"key":"ref16","first-page":"203","article-title":"Using CSP look-back techniques to solve real-world SAT instances","volume-title":"Proc. 14th Nat. Conf. Artif. Intell., 9th Conf. Innov. Appl. Artif. Intell. (AAAI\/IAAI)","author":"Bayardo"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2001.968634"},{"key":"ref19","first-page":"131","article-title":"Conflict-driven clause learning SAT solvers","volume-title":"Handbook of Satisfiability","author":"Marques-Silva","year":"2009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0065"},{"key":"ref23","first-page":"54","article-title":"Model counting: A new strategy for obtaining good bounds","volume-title":"Proc. 21st Nat. Conf. Artif. Intell. (AAAI)","volume":"1","author":"Gomes"},{"key":"ref24","first-page":"1070","article-title":"The stable model semantics for logic programming","volume-title":"Proc. Int. Log. Program. Conf. Symp.","author":"Gelfond"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2200\/s00457ed1v01y201211aim019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1997.612304"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808740"},{"key":"ref28","article-title":"A scalable approximate model counter","author":"Chakraborty","year":"2021","journal-title":"arXiv:1306.5726"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2021.3109080"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/s1471068418000054"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/s1471068415000150"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/LASCAS51355.2021.9459116"},{"key":"ref34","first-page":"2:1","article-title":"Theory solving made easy with clingo 5","volume-title":"Proc. ICLP Tech. Commun. (OASICS)","volume":"52","author":"Gebser"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20528-7_21"},{"key":"ref36","first-page":"208","article-title":"An approximate model counter for ASP","volume-title":"Proc. 18th Int. Workshop Non-Monotonic Reasoning (NMR)","author":"Everardo"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53288-8_22"},{"key":"ref39","first-page":"3569","article-title":"Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls","volume-title":"Proc. 25th Int. Joint Conf. Artif. Intell. (IJCAI)","author":"Chakraborty"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-015-5519-3"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/43.59075"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09773280.pdf?arnumber=9773280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T23:05:05Z","timestamp":1705964705000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9773280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3174564","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}