{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,17]],"date-time":"2026-11-17T12:17:49Z","timestamp":1794917869000,"version":"4.9.1"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,9]]},"abstract":"<jats:p>Knowledge Compilation transforms propositional formulas into tractable structures like decision-DNNF to support efficient reasoning. However, these representations often suffer from exponential size, and standard minimization via SAT sweeping is computationally prohibitive for large instances. In this paper, we propose a scalable minimization framework for decision-DNNF that eliminates the need for SAT solvers. We introduce a semantic hashing technique leveraging polynomial-time model counting to rapidly filter redundancies, followed by a polynomial-time verification strategy based on CNF projection. Our experimental evaluation demonstrates that this approach efficiently compresses decision-DNNF circuits while avoiding the bottleneck of NP-hard equivalence checks.<\/jats:p>","DOI":"10.24963\/ijcai.2026\/420","type":"proceedings-article","created":{"date-parts":[[2026,9,16]],"date-time":"2026-09-16T22:01:13Z","timestamp":1789596073000},"page":"3774-3782","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Minimization of Decision-DNNF Circuits via Semantic Hashing and Provenance Tracking"],"prefix":"10.24963","author":[{"given":"Armin","family":"Biere","sequence":"first","affiliation":[{"name":"University of Freiburg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Marie","family":"Lagniez","sequence":"additional","affiliation":[{"name":"CRIL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanuel","family":"Lonca","sequence":"additional","affiliation":[{"name":"Centre de Recherche en Informatique de Lens"},{"name":"Universit\u00e9 d'Artois"},{"name":"Centre National de la Recherche Scientifique"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"10584","event":{"name":"Thirty-Fifth International Joint Conference on Artificial Intelligence {IJCAI-26}","theme":"Artificial Intelligence","location":"Bremen, Germany","acronym":"IJCAI-2026","number":"35","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2026,8,15]]},"end":{"date-parts":[[2026,8,21]]}},"container-title":["Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2026,11,17]],"date-time":"2026-11-17T11:29:38Z","timestamp":1794914978000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2026\/420"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2026\/420","relation":{},"subject":[],"published":{"date-parts":[[2026,9]]}}}