{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:41:53Z","timestamp":1749318113156,"version":"3.37.3"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-NRFFAI1-2019-0004"],"award-info":[{"award-number":["NRF-NRFFAI1-2019-0004"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.23919\/date56975.2023.10137282","type":"proceedings-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T19:32:57Z","timestamp":1685734377000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Synthesis with Explicit Dependencies"],"prefix":"10.23919","author":[{"given":"Priyanka","family":"Golia","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Kanpur"}]},{"given":"Subhajit","family":"Roy","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kanpur"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[{"name":"National University of Singapore"}]}],"member":"263","reference":[{"year":"2023","author":"golia","journal-title":"Synthesis with explicit dependencies","key":"ref13"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/978-3-030-53291-8_31"},{"key":"ref15","article-title":"Designing samplers is easy: The boon of testers","author":"golia","year":"0","journal-title":"Proc of FMCAD"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ICCAD51958.2021.9643583"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1007\/978-3-662-54577-5_21"},{"key":"ref30","article-title":"Skolem functions for QBF","author":"wimmer","year":"0","journal-title":"Proc of ATVA"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.7873\/DATE.2015.0098"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ICCD.2013.6657071"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1613\/jair.2490"},{"year":"2021","journal-title":"sklearn tree DecisionTreeClassifier","key":"ref2"},{"year":"2020","journal-title":"QBF solver evaluation portal 2020","key":"ref1"},{"year":"1959","author":"henkin","journal-title":"Some remarks on infinitely long formulas infinitistic methods","key":"ref17"},{"key":"ref16","article-title":"WAPS: Weighted and projected sampling","author":"gupta","year":"0","journal-title":"Proc of TACAS"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.23919\/DATE48585.2020.9116504"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/978-3-319-98334-9_13"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/S0898-1221(00)00333-3"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/978-3-319-09284-3_33"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/978-3-030-80223-3_34"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1007\/BF00116251"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/978-94-017-0522-6_7"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.3233\/SAT190077"},{"year":"2021","author":"logic","journal-title":"ABC A System for Sequential Synthesis and Verification","key":"ref21"},{"key":"ref28","article-title":"DQBDD: an efficient BDD-based DQBF solver","author":"s\u00ed?","year":"0","journal-title":"Proc of SAT"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/978-3-030-53288-8_24"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/978-3-030-24258-9_27"},{"key":"ref8","article-title":"idq: Instantiation-based DQBF solving","author":"fr\u00f6hlich","year":"0","journal-title":"Proc of SAT"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/978-3-030-80223-3_11"},{"key":"ref9","article-title":"A guide to the theory of np-completeness","author":"garey","year":"1979","journal-title":"Computers and Intractability"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.3233\/SAT190039"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1016\/j.tcs.2013.12.020"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/FMCAD.2013.6679386"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/978-3-642-54013-4_1"}],"event":{"name":"2023 Design, Automation & Test in Europe Conference & Exhibition (DATE)","start":{"date-parts":[[2023,4,17]]},"location":"Antwerp, Belgium","end":{"date-parts":[[2023,4,19]]}},"container-title":["2023 Design, Automation & Test in Europe Conference & Exhibition (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10136870\/10136706\/10137282.pdf?arnumber=10137282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T17:50:04Z","timestamp":1695664204000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10137282\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":32,"URL":"https:\/\/doi.org\/10.23919\/date56975.2023.10137282","relation":{},"subject":[],"published":{"date-parts":[[2023,4]]}}}