2026-07-25T12:51:32Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23756 2025-11-12T13:00:13Z ddc:004 open_access

Enumerating All Boolean Matches Nadel, Alexander Shalmon, Yogev Boolean Matching All-Boolean-Matching Enumeration SAT Generalization Boolean matching, a fundamental problem in circuit design, determines whether two Boolean circuits are equivalent under input/output permutations and negations. While most works focus on finding a single match or proving its absence, the problem of enumerating all matches remains largely unexplored, with BooM being a notable exception. Motivated by timing challenges in Intel’s library mapping flow, we introduce EBat - an open-source tool for enumerating all matches between single-output circuits. Built from scratch, EBat reuses BooM’s SAT encoding and introduces novel high-level algorithms and performance-critical subroutines to efficiently identify and block multiple mismatches and matches simultaneously. Experiments demonstrate that EBat substantially outperforms BooM’s baseline algorithm, solving 3 to 4 times more benchmarks within a given time limit. EBat has been productized as part of Intel’s library mapping flow, effectively addressing the timing challenges. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Alexander Nadel and Yogev Shalmon 2025 Is Part Of LIPIcs, Volume 341, 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAT.2025.22 urn:nbn:de:0030-drops-237568 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.22 eng https://creativecommons.org/licenses/by/4.0/legalcode