{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T06:11:05Z","timestamp":1758089465522,"version":"3.44.0"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/dac63849.2025.11133351","type":"proceedings-article","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:35:41Z","timestamp":1757957741000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Approximate SMT Counting Beyond Discrete Domains"],"prefix":"10.1109","author":[{"given":"Arijit","family":"Shaw","sequence":"first","affiliation":[{"name":"Chennai Mathematical Institute,India"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA201010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA201009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.002"},{"article-title":"Quantifying software reliability via modelcounting","volume-title":"Proc. of QEST","author":"Teuber","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.11178"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354245"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103572"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-50497-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_16"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA201017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37703-7_1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2018.8603014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-41600-3_11"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53288-8_9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11751"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2863701"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81685-8_32"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_26"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10416"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89960-2_8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/235"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/192"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28640"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_15"},{"article-title":"CSB: A Counting and Sampling Tool for Bitvectors","volume-title":"Proc. of SMT Workshop at CAV","author":"Shaw","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3571287"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2590296.2590328"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94205-6_21"},{"article-title":"VolCE: An Efficient Tool for Solving #SMT(LA) Problems","volume-title":"Proc. of PRUV Workshop at IJCAR","author":"Ge","key":"ref31"},{"article-title":"Probabilistic inference in hybrid domains by weighted model integration","volume-title":"Proc. of IJCAI","author":"Belle","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/100"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.04.003"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/698"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66263-3_1"},{"article-title":"Hashing-based approximate probabilistic inference in hybrid domains","volume-title":"Proc. of UAI","author":"Belle","key":"ref38"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40627-0_18"},{"article-title":"Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls","volume-title":"Proc. of IJCAI","author":"Chakraborty","key":"ref40"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-929-5-633"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808740"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37703-7_7"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10430"},{"key":"ref46","article-title":"High speed hashing for integers and strings","author":"Thorup","year":"2015","journal-title":"arXiv preprint arXiv:1504.06804"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60922-9_46"},{"key":"ref48","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume-title":"Proc. of STOC","author":"Carter"}],"event":{"name":"2025 62nd ACM\/IEEE Design Automation Conference (DAC)","start":{"date-parts":[[2025,6,22]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2025,6,25]]}},"container-title":["2025 62nd ACM\/IEEE Design Automation Conference (DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11132383\/11132091\/11133351.pdf?arnumber=11133351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T05:25:22Z","timestamp":1758000322000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11133351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/dac63849.2025.11133351","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}