{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:08:44Z","timestamp":1777939724516,"version":"3.51.4"},"reference-count":10,"publisher":"Walter de Gruyter GmbH","issue":"2-3","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NSF CAREER Award","award":["2607625"],"award-info":[{"award-number":["2607625"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p xml:lang=\"en\">Sentential Decision Diagrams (SDDs) are a generalization of Binary Decision Diagrams (BDDs) that allow decisions based on \u201csentences\u201d of variables, rather than only individual variables. SDDs are ordered based on a binary tree of variables (a vtree) which can represent their more complex structure. Like BDDs, the order of an SDD significantly impacts its size. We present two novel SDD minimization methods based on Rudell\u2019s sifting algorithm and a symmetric sifting algorithm, both of which are BDD minimization methods. To evaluate the performance of our proposed techniques, we compile the combinational benchmarks from the LGSynth\u201991 benchmark set and dynamically minimize each circuit with our proposed techniques and two variations of the current state-of-the-art method. Our methods show an average improvement ratio of 20.2\u202f% in SDD size compared with the current state-of-the-art technique. For larger circuits (\u226550 inputs), the improvement ratio increases to 39.2\u202f%.<\/jats:p>","DOI":"10.1515\/itit-2025-0032","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:10:41Z","timestamp":1773245441000},"page":"107-114","source":"Crossref","is-referenced-by-count":0,"title":["A novel minimization method for\u00a0sentential decision diagrams"],"prefix":"10.1515","volume":"67","author":[{"given":"Joseph","family":"Clark","sequence":"first","affiliation":[{"name":"University of Tennessee, Electrical Engineering and Computer Science , Knoxville , TN , USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Himanshu","family":"Thapliyal","sequence":"additional","affiliation":[{"name":"Southern Methodist University, Electrical and Computer Engineering & Computer Science , Dallas , TX , USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2026,3,12]]},"reference":[{"key":"2026050205254502506_j_itit-2025-0032_ref_001","unstructured":"A. Darwiche, \u201cSdd: A new canonical representation of propositional knowledge bases,\u201d in Twenty-Second International Joint Conference on Artificial Intelligence, 2011."},{"key":"2026050205254502506_j_itit-2025-0032_ref_002","doi-asserted-by":"crossref","unstructured":"A. Choi, D. Kisa, and A. Darwiche, \u201cCompiling probabilistic graphical models using sentential decision diagrams,\u201d in European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Springer, 2013, pp.\u00a0121\u2013132.","DOI":"10.1007\/978-3-642-39091-3_11"},{"key":"2026050205254502506_j_itit-2025-0032_ref_003","unstructured":"J. Vlasselaer, J. Renkens, G. Van den Broeck, and L. De Raedt, \u201cCompiling probabilistic logic programs into sentential decision diagrams,\u201d in Proceedings Workshop on Probabilistic Logic Programming (PLP), 2014, pp.\u00a01\u201310."},{"key":"2026050205254502506_j_itit-2025-0032_ref_004","unstructured":"M. Popov, T. Balyo, M. Iser, and T. Ostertag, \u201cConstruction of decision diagrams for product configuration,\u201d in International Workshop on Configuration, CEUR, 2023, pp.\u00a0108\u2013117."},{"key":"2026050205254502506_j_itit-2025-0032_ref_005","doi-asserted-by":"crossref","unstructured":"S. Bova, \u201cSdds are exponentially more succinct than obdds,\u201d in Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a030, 2016.","DOI":"10.1609\/aaai.v30i1.10107"},{"key":"2026050205254502506_j_itit-2025-0032_ref_006","unstructured":"K. Pipatsrisawat and A. Darwiche, \u201cNew compilation languages based on structured decomposability,\u201d in AAAI, vol.\u00a08, 2008, pp.\u00a0517\u2013522."},{"key":"2026050205254502506_j_itit-2025-0032_ref_007","doi-asserted-by":"crossref","unstructured":"A. Choi and A. Darwiche, \u201cDynamic minimization of sentential decision diagrams,\u201d in Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a027, 2013, pp.\u00a0187\u2013194.","DOI":"10.1609\/aaai.v27i1.8690"},{"key":"2026050205254502506_j_itit-2025-0032_ref_008","doi-asserted-by":"crossref","unstructured":"R. Rudell, \u201cDynamic variable ordering for ordered binary decision diagrams,\u201d in Proceedings of 1993 International Conference on Computer Aided Design (ICCAD), IEEE, 1993, pp.\u00a042\u201347.","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"2026050205254502506_j_itit-2025-0032_ref_009","doi-asserted-by":"crossref","unstructured":"S. Panda, F. Somenzi, and B. F. Plessier, \u201cSymmetry detection and dynamic variable ordering of decision diagrams,\u201d in ICCAD, Citeseer, 1994, pp.\u00a0628\u2013631.","DOI":"10.1109\/ICCAD.1994.629887"},{"key":"2026050205254502506_j_itit-2025-0032_ref_010","unstructured":"S. Panda and F. Somenzi, \u201cWho are the variables in your neighbourhood,\u201d in Proceedings of IEEE International Conference on Computer Aided Design (ICCAD), IEEE, 1995, pp.\u00a074\u201377."}],"container-title":["it - Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/itit-2025-0032\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/itit-2025-0032\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T05:26:01Z","timestamp":1777699561000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/itit-2025-0032\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,1]]},"references-count":10,"journal-issue":{"issue":"2-3","published-online":{"date-parts":[[2026,3,10]]},"published-print":{"date-parts":[[2025,5,26]]}},"alternative-id":["10.1515\/itit-2025-0032"],"URL":"https:\/\/doi.org\/10.1515\/itit-2025-0032","relation":{},"ISSN":["1611-2776","2196-7032"],"issn-type":[{"value":"1611-2776","type":"print"},{"value":"2196-7032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,1]]}}}