{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:46:14Z","timestamp":1743025574324,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031067723"},{"type":"electronic","value":"9783031067730"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06773-0_42","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"790-799","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Power of\u00a0Disjoint Support Decompositions in\u00a0Decision Diagrams"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8199-0901","authenticated-orcid":false,"given":"Lieuwe","family":"Vinkhuijzen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2433-4174","authenticated-orcid":false,"given":"Alfons","family":"Laarman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Al-Rabadi, A.N., Perkowski, M., Zwick, M.: A comparison of modified reconstructability analysis and Ashenhurst-Curtis decomposition of Boolean functions, Kybernetes (2004)","DOI":"10.1108\/03684920410533985"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Amar\u00fa, L., Gaillardon, P.-E., De Micheli, G.: BDS-MAJ: A BDD-based logic synthesis tool exploiting majority logic decomposition. In: Proceedings of the 50th Annual Design Automation Conference, pp. 1\u20136 (2013)","DOI":"10.1145\/2463209.2488792"},{"key":"42_CR3","unstructured":"Ashenhurst, R.L.: The decomposition of switching functions. In: Proceedings of an International Symposium on the Theory of Switching, April 1957 (1957)"},{"key":"42_CR4","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Bertacco, V.: The disjunctive decomposition of logic functions. In: Proceedings of the International Conference on Computer-Aided Design (ICCAD 1997), November 1997, pp. 78\u201382 (1997)","DOI":"10.1109\/ICCAD.1997.643371"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Bertacco, V., Damiani, M.: Boolean function representation based on disjoint-support decompositions. In: Proceedings International Conference on Computer Design. VLSI in Computers and Processors, pp. 27\u201332. IEEE (1996)","DOI":"10.1109\/ICCD.1996.563527"},{"issue":"6","key":"42_CR7","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1007\/s00224-018-9904-z","volume":"63","author":"B Bollig","year":"2019","unstructured":"Bollig, B., Buttkus, M.: On the relative succinctness of sentential decision diagrams. Theory Comput. Syst. 63(6), 1250\u20131277 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"42_CR8","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00224-020-10003-y","volume":"65","author":"B Bollig","year":"2021","unstructured":"Bollig, B., Farenholtz, M.: On the relation between structured d-DNNFs and SDDs. Theory Comput. Syst. 65(2), 274\u2013295 (2021)","journal-title":"Theory Comput. Syst."},{"issue":"9","key":"42_CR9","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9), 993\u20131002 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Bova, S.: SDDs are exponentially more succinct than OBDDs. In: Thirtieth AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10107"},{"issue":"8","key":"42_CR11","first-page":"677","volume":"35","author":"E Randal","year":"1986","unstructured":"Randal, E.: Bryant, Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Computers"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-89960-2_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"RE Bryant","year":"2018","unstructured":"Bryant, R.E.: Chain reduction for binary and zero-suppressed decision diagrams. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 81\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_5"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ijar.2021.07.007","volume":"138","author":"GH Dal","year":"2021","unstructured":"Dal, G.H., Laarman, A.W., Hommersom, A., Lucas, P.J.F.: A compositional approach to probabilistic knowledge compilation. Int. J. Approximate Reasoning 138, 38\u201366 (2021)","journal-title":"Int. J. Approximate Reasoning"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Damiani, M., Bertacco, V.: Finding complex disjunctive decompositions of logic functions. In: Proceedings of the International Workshop on Logic & Synthesis, pp. 478\u2013483 (1998)","DOI":"10.1109\/ICCAD.1997.643371"},{"key":"42_CR15","unstructured":"Darwiche, A.: SDD: a new canonical representation of propositional knowledge bases. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence-Volume Two, pp. 819\u2013826. AAAI Press (2011)"},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"42_CR17","unstructured":"Gergov, J., Meinel, C.: Efficient Boolean manipulation with OBDDs can be extended to FBDDs. Universit\u00e4t Trier, Mathematik\/Informatik, Forschungsbericht, pp. 93\u201312 (1993)"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Hong, X., Ying, M., Feng, Y., Zhou, X., Li, S.: Approximate equivalence checking of noisy quantum circuits. arXiv preprint arXiv:2103.11595 (2021)","DOI":"10.1109\/DAC18074.2021.9586214"},{"issue":"4","key":"42_CR19","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1613\/jair.2605","volume":"33","author":"R Mateescu","year":"2008","unstructured":"Mateescu, R., Dechter, R., Marinescu, R.: And\/or multi-valued decision diagrams (AOMDDs) for graphical models. J. Artif. Intelli. Res. 33, 465\u2013519 (2008)","journal-title":"J. Artif. Intelli. Res."},{"key":"42_CR21","unstructured":"Matsunaga, Y.: An exact and efficient algorithm for disjunctive decomposition. In: Proceedings of Synthesis and System Integration of Mixed Technologies (SASIMI 1998, Japan), October 1998"},{"key":"42_CR22","unstructured":"McMillan, K.L.: Symbolic model checking: an approach to the state explosion problem, Ph.D. thesis, 1992, UMI No. GAX92-24209"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the 30th ACM\/IEEE Design Automation Conference, pp. 272\u2013277. IEEE (1993)","DOI":"10.1145\/157485.164890"},{"key":"42_CR24","unstructured":"Minato, S.: Finding simple disjoint decompositions in frequent itemset data using zero-suppressed BDD. In: Proceedings of IEEE ICDM 2005 Workshop on Computational Intelligence in Data Mining, pp. 3\u201311 (2005)"},{"issue":"1","key":"42_CR25","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TCAD.2015.2459034","volume":"35","author":"P Niemann","year":"2015","unstructured":"Niemann, P., Wille, R., Miller, D.M., Thornton, M.A., Drechsler, R.: QMDDs: efficient quantum function representation and manipulation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35(1), 86\u201399 (2015)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"42_CR26","unstructured":"Plaza, S., Bertacco, V.: Boolean operations on decomposed functions. In: Proceedings of the 24th International Workshop on Logic & Synthesis, pp. 310\u2013317 (2005)"},{"key":"42_CR27","doi-asserted-by":"crossref","unstructured":"Plaza, S., Bertacco, V.: STACCATO: disjoint support decompositions from BDDs through symbolic kernels. In: Proceedings of the 2005 Asia and South Pacific Design Automation Conference, pp. 276\u2013279 (2005)","DOI":"10.1145\/1120725.1120848"},{"key":"42_CR28","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-1-4615-3154-8_11","volume-title":"Logic Synthesis and Optimization, The Kluwer International Series in Engineering and Computer Science","author":"T Sasao","year":"1993","unstructured":"Sasao, T.: FPGA design by generalized functional decomposition. In: Sasao, T. (ed.) Logic Synthesis and Optimization, The Kluwer International Series in Engineering and Computer Science, vol. 212, pp. 233\u2013258. Springer, Boston (1993). https:\/\/doi.org\/10.1007\/978-1-4615-3154-8_11"},{"key":"42_CR29","unstructured":"Sasao, T., Matsuura, M.: DECOMPOS: an integrated system for functional decomposition. In: International Workshop on Logic Synthesis, vol. 1998, pp. 471\u2013477 (1998)"},{"issue":"1","key":"42_CR30","first-page":"55","volume":"18","author":"M Soeken","year":"2012","unstructured":"Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: a toolkit for reversible circuit design. J. Multiple Valued Log. Soft Comput. 18(1), 55\u201365 (2012)","journal-title":"J. Multiple Valued Log. Soft Comput."},{"key":"42_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jsc.2015.03.002","volume":"73","author":"M Soeken","year":"2016","unstructured":"Soeken, M., Tague, L., Dueck, G.W., Drechsler, R.: Ancilla-free synthesis of large reversible functions using binary decision diagrams. J. Symb. Comput. 73, 1\u201326 (2016)","journal-title":"J. Symb. Comput."},{"key":"42_CR32","doi-asserted-by":"crossref","unstructured":"Van den Broeck, G., Darwiche, A.: On the role of canonicity in knowledge compilation. In: Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9423"},{"key":"42_CR33","doi-asserted-by":"crossref","unstructured":"van Dijk, T., Wille, R., Meolic, R.: Tagged BDDs: combining reduction rules from different decision diagram types. In: Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design, FMCAD Inc, pp. 108\u2013115 (2017)","DOI":"10.23919\/FMCAD.2017.8102248"},{"key":"42_CR34","doi-asserted-by":"crossref","unstructured":"Viamontes, G.F., Rajagopalan, M., Markov, I.L., Hayes, J.P.: Gate-level simulation of quantum circuits. In: Proceedings of the 2003 Asia and South Pacific Design Automation Conference, pp. 295\u2013301 (2003)","DOI":"10.1145\/1119772.1119829"},{"key":"42_CR35","unstructured":"Vinkhuijzen, L., Coopmans, T., Elkouss, D., Dunjko, V., Laarman, A.: LIMDD a decision diagram for simulation of quantum computing including stabilizer states, arXiv preprint arXiv:2108.00931 (2021)"},{"key":"42_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-62822-2_8","volume-title":"Dependable Software Engineering. Theories, Tools, and Applications","author":"L Vinkhuijzen","year":"2020","unstructured":"Vinkhuijzen, L., Laarman, A.: Symbolic model checking with sentential decision diagrams. In: Pang, J., Zhang, L. (eds.) SETTA 2020. LNCS, vol. 12153, pp. 124\u2013142. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62822-2_8"},{"key":"42_CR37","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: Proceedings of the 46th Annual Design Automation Conference, pp. 270\u2013275 (2009)","DOI":"10.1145\/1629911.1629984"},{"key":"42_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-319-59936-6_18","volume-title":"Reversible Computation","author":"A Zulehner","year":"2017","unstructured":"Zulehner, A., Wille, R.: Improving synthesis of reversible circuits: exploiting redundancies in paths and nodes of QMDDs. In: Phillips, I., Rahaman, H. (eds.) RC 2017. LNCS, vol. 10301, pp. 232\u2013247. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59936-6_18"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06773-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T14:27:21Z","timestamp":1727274441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pasadena, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}