{"type":"ScholarlyArticle","title":"DPSampler: Exact Weighted Sampling Using Dynamic Programming","authors":[{"name":"Jeffrey M. Dudek","slug":"jeffrey-m-dudek","given":"Jeffrey M.","family":"Dudek","affiliation":"Rice University"},{"name":"Aditya A. Shrotri","slug":"aditya-a-shrotri","given":"Aditya A.","family":"Shrotri","affiliation":"Rice University"},{"name":"Moshe Y. Vardi","slug":"moshe-y-vardi","given":"Moshe Y.","family":"Vardi","affiliation":"Rice University"}],"abstract":"The problem of exact weighted sampling of solutions of Boolean formulas has applications in Bayesian inference, testing, and verification. The state-of-the-art approach to sampling involves carefully decomposing the input formula and compiling a data structure called d-DNNF in the process. Recent work in the closely connected field of model counting, however, has shown that smartly composing different subformulas using dynamic programming and Algebraic Decision Diagrams (ADDs) can outperform d-DNNF-style approaches on many benchmarks. In this work, we present a modular algorithm called DPSampler that extends such dynamic-programming techniques to the problem of exact weighted sampling. \r\n\r\nDPSampler operates in three phases. First, an execution plan in the form of a project-join tree is computed using tree decompositions. Second, the plan is used to compile the input formula into a succinct tree-of-ADDs representation. Third, this tree is traversed to generate a random sample. This decoupling of planning, compilation and sampling phases enables usage of specialized libraries for each purpose in a black-box fashion. Further, our novel ADD-sampling algorithm avoids the need for expensive dynamic memory allocation required in previous work. Extensive experiments over diverse sets of benchmarks show DPSampler is more scalable and versatile than existing approaches.","doi":"10.24963/ijcai.2022/250","url":"https://ijcai.org/proceedings/2022/250","pdf":"https://ijcai.org/proceedings/2022/0250.pdf","markdown":"https://ijcai.org/proceedings/2022/250.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/250","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":250,"pages":{"first":1795,"last":1803},"keywords":["Constraint Satisfaction and Optimization: Constraint Satisfaction","Constraint Satisfaction and Optimization: Solvers and Tools","Constraint Satisfaction and Optimization: Satisfiabilty","Constraint Satisfaction and Optimization: Applications","Constraint Satisfaction and Optimization: Other"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986639","length_sec":89,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984782","length_sec":354,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Achlioptas et al., 2018] Dimitris Achlioptas, Zayd S Ham- moudeh, and Panos Theodoropoulos. Fast sampling of perfectly uniform satisfying assignments. In International Conference on Theory and Applications of Satisfiability Testing, pages 135-147. Springer, 2018.","title":"Fast sampling of perfectly uniform satisfying assignments","authors":"Dimitris Achlioptas, Zayd S Hammoudeh, Panos Theodoropoulos","year":"2018","venue":"International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bacchus et al., 2003] Fahiem Bacchus, Shannon Dalmao, and Toniann Pitassi. Algorithms and complexity results for# sat and bayesian inference. In 44th Annual IEEE Sym- posium on Foundations of Computer Science, 2003. Pro- ceedings., pages 340-351. IEEE, 2003.","title":"Algorithms and complexity results for# sat and bayesian inference","authors":"Bacchus","year":"2003","venue":"44th Annual IEEE Symposium on Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Bahar et al., 97]","title":null,"authors":"Bahar","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"R Iris Bahar, Erica A Frohm, Charles M Gaona, Gary D Hachtel, Enrico Macii, Abelardo Pardo, and Fabio Somenzi. Algebraic decision diagrams and their applications. Form Method Sys Des, 10(2-3):171-206, '97.","title":"Algebraic decision diagrams and their applications","authors":"Iris Bahar, Erica A Frohm, Charles M Gaona, Gary D Hachtel, Enrico Macii, Abelardo Pardo, Fabio Somenzi","year":null,"venue":"Form Method Sys Des","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bellare et al., 2000] Mihir Bellare, Oded Goldreich, and Erez Petrank. Uniform generation of np-witnesses using an np-oracle. Information and Computation, 163(2):510- 526, 2000.","title":"Uniform generation of np-witnesses using an np-oracle","authors":"Mihir Bellare, Oded Goldreich, Erez Petrank","year":"2000","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bova et al., 2015] Simone Bova, Florent Capelli, Stefan Mengel, and Friedrich Slivovsky. On compiling cnfs into structured deterministic dnnfs. In International Confer- ence on Theory and Applications of Satisfiability Testing, pages 199-214. Springer, 2015.","title":"On compiling cnfs into structured deterministic dnnfs","authors":"Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky","year":"2015","venue":"International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brayton et al., 1984] Robert K Brayton, Gary D Hachtel, Curt McMullen, and Alberto Sangiovanni-Vincentelli. Logic minimization algorithms for VLSI synthesis, vol- ume 2. Springer Science & Business Media, 1984.","title":"Logic minimization algorithms for VLSI synthesis","authors":"Gary D Robert K Brayton, Curt Hachtel, Alberto Mcmullen, Sangiovanni-Vincentelli","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bryant, 1986] Randal E Bryant. Graph-based algorithms for Boolean function manipulation. IEEE TC, 100(8):677- 691, 1986.","title":"Graph-based algorithms for Boolean function manipulation","authors":"Randal E Bryant","year":"1986","venue":"IEEE TC","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chakraborty et al., 2014a] Supratik Chakraborty, Daniel Fremont, Kuldeep Meel, Sanjit Seshia, and Moshe Vardi. Distribution-aware sampling and weighted model count- ing for sat. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 28, 2014.","title":"Distribution-aware sampling and weighted model counting for sat","authors":"Chakraborty","year":"2014","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Chakraborty et al., 2014b] Supratik Chakraborty, Kuldeep S Meel, and Moshe Y Vardi. Balancing scalability and uniformity in sat witness generator. In 2014 51st acm/edac/ieee design automation conference (dac), pages 1-6. IEEE, 2014.","title":"Balancing scalability and uniformity in sat witness generator","authors":"Supratik Chakraborty, Kuldeep S Meel, Moshe Y Vardi","year":"2014","venue":"51st acm/edac/ieee design automation conference","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Chakraborty et al., 2015] Supratik Chakraborty, Daniel J Fremont, Kuldeep S Meel, Sanjit A Seshia, and Moshe Y Vardi. On parallel scalable uniform sat witness generation. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 304-319. Springer, 2015.","title":"On parallel scalable uniform sat witness generation","authors":"Supratik Chakraborty, J Daniel, Fremont, S Kuldeep, Sanjit A Meel, Moshe Y Seshia, Vardi","year":"2015","venue":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Chakraborty et al., 2020] Supratik Chakraborty, Aditya A Shrotri, and Moshe Y Vardi. On Uniformly Sampling Traces of a Transition System. In 2020 IEEE/ACM In- ternational Conference On Computer Aided Design (IC- CAD), pages 1-9. IEEE, 2020.","title":"On Uniformly Sampling Traces of a Transition System","authors":"Supratik Chakraborty, Aditya A Shrotri, Moshe Y Vardi","year":"2020","venue":"IEEE/ACM International Conference On Computer Aided Design (IC-CAD)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Chavira and Darwiche, 2007] Mark Chavira and Adnan Darwiche. Compiling Bayesian networks using variable elimination. In IJCAI, pages 2443-2449, 2007.","title":"Compiling Bayesian networks using variable elimination","authors":"Darwiche Chavira, Mark Chavira, Adnan Darwiche","year":"2007","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/393"},{"position":14,"raw":"[Darwiche and Marquis, 2002] Adnan Darwiche and Pierre Marquis. A knowledge compilation map. Journal of Arti- ficial Intelligence Research, 17:229-264, 2002.","title":"A knowledge compilation map","authors":"Marquis ; Darwiche, Adnan Darwiche, Pierre Marquis","year":"2002","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Darwiche, 2004] Adnan Darwiche. New advances in com- piling cnf to decomposable negation normal form. In Proc. of ECAI, pages 328-332. Citeseer, 2004.","title":"New advances in compiling cnf to decomposable negation normal form","authors":"Adnan Darwiche","year":"2004","venue":"Proc. of ECAI","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Darwiche, 2011] Adnan Darwiche. Sdd: A new canoni- cal representation of propositional knowledge bases. In Twenty-Second International Joint Conference on Artifi- cial Intelligence, 2011.","title":"Sdd: A new canonical representation of propositional knowledge bases","authors":"Adnan Darwiche","year":"2011","venue":"Twenty-Second International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2011/143"},{"position":17,"raw":"[de Colnet and Mengel, 2021] Alexis de Colnet and Ste- fan Mengel. Lower bounds on intermediate results in bottom-up knowledge compilation. arXiv preprint arXiv:2112.12430, 2021.","title":"Alexis de Colnet and Stefan Mengel. Lower bounds on intermediate results in bottom-up knowledge compilation","authors":"Colnet De, Mengel","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Dudek et al., 2019] Jeffrey M Dudek, Leonardo Dueñas- Osorio, and Moshe Y Vardi. Efficient contraction of large tensor networks for weighted model counting through graph decompositions. preprint arXiv:1908.04381, 2019.","title":"Efficient contraction of large tensor networks for weighted model counting through graph decompositions","authors":"Leonardo Jeffrey M Dudek, Moshe Y Dueñas-Osorio, Vardi","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Dudek et al., 2020a] Jeffrey M. Dudek, Vu H. N. Phan, and Moshe Y. Vardi. ADDMC: weighted model counting with algebraic decision diagrams. In AAAI, volume 34, pages 1468-1476, 2020.","title":"ADDMC: weighted model counting with algebraic decision diagrams","authors":"Dudek","year":"2020","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Dudek et al., 2020b] Jeffrey M Dudek, Vu HN Phan, and Moshe Y Vardi. Dpmc: Weighted model counting by dy- namic programming on project-join trees. In International Conference on Principles and Practice of Constraint Pro- gramming, pages 211-230. Springer, 2020.","title":"Dpmc: Weighted model counting by dynamic programming on project-join trees","authors":"Dudek","year":"2020","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Dudek et al., 2021] Jeffrey M Dudek, Vu HN Phan, and Moshe Y Vardi. Procount: Weighted projected model counting with graded project-join trees. In International Conference on Theory and Applications of Satisfiability Testing, pages 152-170. Springer, 2021.","title":"Procount: Weighted projected model counting with graded project-join trees","authors":"Jeffrey M Dudek, Moshe Y Vu Hn Phan, Vardi","year":"2021","venue":"International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Dutra et al., 2018] Rafael Dutra, Kevin Laeufer, Jonathan Bachrach, and Koushik Sen. Efficient sampling of sat so- lutions for testing. In 2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE), pages 549- 559. IEEE, 2018.","title":"Efficient sampling of sat solutions for testing","authors":"Dutra","year":"2018","venue":"IEEE/ACM 40th International Conference on Software Engineering (ICSE)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Fargier and Marquis, 2009] Hélène Fargier and Pierre Mar- quis. Knowledge compilation properties of trees-of-bdds, revisited. In Twenty-First International Joint Conference on Artificial Intelligence, 2009.","title":"Hélène Fargier and Pierre Marquis. Knowledge compilation properties of trees-of-bdds, revisited","authors":"Marquis Fargier","year":"2009","venue":"Twenty-First International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Fargier et al., 2014] Hélene Fargier, Pierre Marquis, Alexandre Niveau, and Nicolas Schmidt. A knowl- edge compilation map for ordered real-valued decision diagrams. In AAAI, 2014.","title":"A knowledge compilation map for ordered real-valued decision diagrams","authors":"Fargier","year":"2014","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Fichte et al., 2022] Johannes K Fichte, Markus Hecher, Patrick Thier, and Stefan Woltran. Exploiting database management systems and treewidth for counting. The- ory and Practice of Logic Programming, 22(1):128-157, 2022.","title":"Exploiting database management systems and treewidth for counting","authors":"Markus Johannes K Fichte, Patrick Hecher, Stefan Thier, Woltran","year":"2022","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Gogate and Domingos, 2011] Vibhav Gogate and Pedro Domingos. Approximation by Quantization. In UAI, pages 247-255, 2011.","title":"Vibhav Gogate and Pedro Domingos. Approximation by Quantization","authors":"Domingos Gogate","year":"2011","venue":"UAI","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Gomes et al., 2006] Carla P Gomes, Ashish Sabharwal, and Bart Selman. Near-uniform sampling of combinatorial spaces using xor constraints. In NIPS, pages 481-488, 2006.","title":"Near-uniform sampling of combinatorial spaces using xor constraints","authors":"Carla P Gomes, Ashish Sabharwal, Bart Selman","year":"2006","venue":"NIPS","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Gupta et al., 2019] Rahul Gupta, Shubham Sharma, Subha- jit Roy, and Kuldeep S Meel. Waps: Weighted and pro- jected sampling. In TACAS (1), pages 59-76, 2019.","title":"Waps: Weighted and projected sampling","authors":"Rahul Gupta, Shubham Sharma, Subhajit Roy, Kuldeep S Meel","year":"2019","venue":"TACAS (1)","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Hoey et al., 1999] Jesse Hoey, Robert St-Aubin, Alan Hu, and Craig Boutilier. SPUDD: stochastic planning using decision diagrams. In UAI, pages 279-288, 1999.","title":"SPUDD: stochastic planning using decision diagrams","authors":"Jesse Hoey, Robert St-Aubin, Alan Hu, Craig Boutilier","year":"1999","venue":"UAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Jerrum et al., 1986] Mark R Jerrum, Leslie G Valiant, and Vijay V Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical com- puter science, 43:169-188, 1986.","title":"Random generation of combinatorial structures from a uniform distribution","authors":"Leslie G Mark R Jerrum, Vijay V Valiant, Vazirani","year":"1986","venue":"Theoretical computer science","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Kitchen, 2010] Nathan Boyd Kitchen. Markov Chain Monte Carlo stimulus generation for constrained random simula- tion. University of California, Berkeley, 2010.","title":"Markov Chain Monte Carlo stimulus generation for constrained random simulation","authors":"Nathan Boyd Kitchen","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Korhonen and Järvisalo, 2021] Tuukka Korhonen and Matti Järvisalo. Integrating tree decompositions into decision heuristics of propositional model counters. In 27th In- ternational Conference on Principles and Practice of Constraint Programming (CP 2021). Schloss Dagstuhl- Leibniz-Zentrum für Informatik, 2021.","title":"Integrating tree decompositions into decision heuristics of propositional model counters","authors":"Järvisalo Korhonen, Tuukka Korhonen, Matti Järvisalo","year":"2021","venue":"27th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Lagniez and Marquis, 2017] Jean-Marie Lagniez and Pierre Marquis. An improved decision-DNNF compiler. In IJ- CAI, pages 667-673, 2017.","title":"An improved decision-DNNF compiler","authors":"Marquis ; Jean-Marie Lagniez, Pierre Lagniez, Marquis","year":"2017","venue":"IJ-CAI","doi":null,"url":null,"internal_url":"/proceedings/2017/93"},{"position":34,"raw":"[Meel, 2018] Kuldeep S Meel. Constrained counting and sampling: bridging the gap between theory and practice. arXiv preprint arXiv:1806.02239, 2018.","title":"Constrained counting and sampling: bridging the gap between theory and practice","authors":"S Kuldeep, Meel","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Muise et al., 2012] Christian Muise, Sheila A McIlraith, J Christopher Beck, and Eric I Hsu. D sharp: fast d-dnnf compilation with sharpsat. In Canadian Conference on Artificial Intelligence, pages 356-361. Springer, 2012.","title":"D sharp: fast d-dnnf compilation with sharpsat","authors":"Christian Muise, Sheila A Mcilraith, Christopher Beck, Eric I Hsu","year":"2012","venue":"Canadian Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Naveh et al., 2007] Yehuda Naveh, Michal Rimon, Itai Jaeger, Yoav Katz, Michael Vinov, Eitan s Marcu, and Gil Shurek. Constraint-based random stimuli generation for hardware verification. AI magazine, 28(3):13-13, 2007.","title":"Constraint-based random stimuli generation for hardware verification","authors":"Naveh","year":"2007","venue":"AI magazine","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Roy et al., 2018] Subhajit Roy, Awanish Pandey, Brendan Dolan-Gavitt, and Yu Hu. Bug synthesis: Challenging bug-finding tools with deep faults. In Proceedings of the 2018 26th ACM Joint Meeting on European Software En- gineering Conference and Symposium on the Foundations of Software Engineering, pages 224-234, 2018.","title":"Bug synthesis: Challenging bug-finding tools with deep faults","authors":"Subhajit Roy, Awanish Pandey, Brendan Dolan-Gavitt, Yu Hu","year":"2018","venue":"Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Samer and Szeider, 2010] Marko Samer and Stefan Szeider. Algorithms for propositional model counting. Journal of Discrete Algorithms, 8(1):50-64, 2010.","title":"Algorithms for propositional model counting","authors":"Marko Samer, Stefan Szeider","year":"2010","venue":"Journal of Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Sharma et al., 2018] Shubham Sharma, Rahul Gupta, Sub- hajit Roy, and Kuldeep S Meel. Knowledge compilation meets uniform sampling. In LPAR, pages 620-636, 2018.","title":"Knowledge compilation meets uniform sampling","authors":"Shubham Sharma, Rahul Gupta, Subhajit Roy, Kuldeep S Meel","year":"2018","venue":"LPAR","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Somenzi, 2012] Fabio Somenzi. Cudd: Cu decision dia- gram package-release 2.4. 0. University of Colorado at Boulder, 2012.","title":"Cu decision diagram package-release 2.4. 0","authors":"Fabio Somenzi, Cudd","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Soos et al., 2020] Mate Soos, Stephan Gocht, and Kuldeep S Meel. Tinted, detached, and lazy cnf-xor solving and its applications to counting and sampling. In International Conference on Computer Aided Verification, pages 463-484. Springer, 2020.","title":"Tinted, detached, and lazy cnf-xor solving and its applications to counting and sampling","authors":"Soos","year":"2020","venue":"International Conference on Computer Aided Verification","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Strasser, 2017] Ben Strasser. Computing tree decompo- sitions with flowcutter: Pace 2017 submission. arXiv preprint arXiv:1709.08949, 2017.","title":"Computing tree decompositions with flowcutter: Pace 2017 submission","authors":"Ben Strasser","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Subbarayan et al., 2007] Sathiamoorthy Subbarayan, Lucas Bordeaux, and Youssef Hamadi. Knowledge compilation properties of tree-of-bdds. In AAAI, pages 502-507, 2007.","title":"Knowledge compilation properties of tree-of-bdds","authors":"Subbarayan","year":"2007","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Subbarayan, 2005] Sathiamoorthy Subbarayan. Integrating csp decomposition techniques and bdds for compiling con- figuration problems. In International Conference on In- tegration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, pages 351-365. Springer, 2005.","title":"Sathiamoorthy Subbarayan. Integrating csp decomposition techniques and bdds for compiling configuration problems","authors":"Subbarayan","year":"2005","venue":"International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[van Dijk and van de Pol, 2017] Tom van Dijk and Jaco van de Pol. Sylvan: multi-core framework for decision di- agrams. International Journal on Software Tools for Tech- nology Transfer, 19(6):675-696, 2017.","title":"Sylvan: multi-core framework for decision diagrams","authors":"Van Dijk, ; Van De Pol, Jaco Dijk, Van De Pol","year":"2017","venue":"International Journal on Software Tools for Technology Transfer","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Wang et al., 2001] Dong Wang, Edmund Clarke, Yunshan Zhu, and James Kukula. Using cutwidth to improve symbolic simulation and boolean satisfiability. In Sixth IEEE International High-Level Design Validation and Test Workshop, pages 165-170. IEEE, 2001.","title":"Using cutwidth to improve symbolic simulation and boolean satisfiability","authors":"Dong Wang, Edmund Clarke, Yunshan Zhu, James Kukula","year":"2001","venue":"Sixth IEEE International High-Level Design Validation and Test Workshop","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Yuan et al., 2004] Jun Yuan, Adnan Aziz, Carl Pixley, and Ken Albin. Simplifying boolean constraint solving for random simulation-vector generation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Sys- tems, 23(3):412-420, 2004.","title":"Simplifying boolean constraint solving for random simulation-vector generation","authors":"Yuan","year":"2004","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}