Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.19103 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908283354218496 |
|---|---|
| author | Averkov, Daniil Emdin, Gregory Krivogornitsyna, Viktoriia Kulikov, Alexander S. Kurmazov, Fedor Smal, Alexander Vaskin, Vsevolod |
| author_facet | Averkov, Daniil Emdin, Gregory Krivogornitsyna, Viktoriia Kulikov, Alexander S. Kurmazov, Fedor Smal, Alexander Vaskin, Vsevolod |
| contents | The Boolean circuit simplification problem involves finding a smaller circuit that computes the same function as a given Boolean circuit. This problem is closely related to several key areas with both theoretical and practical applications, such as logic synthesis, satisfiability, and verification.
In this paper, we present Simplifier, a new open source tool for simplifying Boolean circuits. The tool optimizes subcircuits with three inputs and at most three outputs, seeking to improve each one. It is designed as a low-effort method that runs in just a few seconds for circuits of reasonable size. This efficiency is achieved by combining two key strategies. First, the tool utilizes a precomputed database of optimized circuits, generated with SAT solvers after carefully clustering Boolean functions with three inputs and up to three outputs. Second, we demonstrate that it is sufficient to check a linear number of subcircuits, relative to the size of the original circuit. This allows a single iteration of the tool to be executed in linear time.
We evaluated the tool on a wide range of Boolean circuits, including both industrial and hand-crafted examples, in two popular formats: AIG and BENCH. For AIG circuits, after applying the state-of-the-art ABC framework, our tool achieved an additional 4% average reduction in size. For BENCH circuits, the tool reduced their size by an average of 30%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_19103 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Simplifier: A New Tool for Boolean Circuit Simplification Averkov, Daniil Emdin, Gregory Krivogornitsyna, Viktoriia Kulikov, Alexander S. Kurmazov, Fedor Smal, Alexander Vaskin, Vsevolod Logic in Computer Science The Boolean circuit simplification problem involves finding a smaller circuit that computes the same function as a given Boolean circuit. This problem is closely related to several key areas with both theoretical and practical applications, such as logic synthesis, satisfiability, and verification. In this paper, we present Simplifier, a new open source tool for simplifying Boolean circuits. The tool optimizes subcircuits with three inputs and at most three outputs, seeking to improve each one. It is designed as a low-effort method that runs in just a few seconds for circuits of reasonable size. This efficiency is achieved by combining two key strategies. First, the tool utilizes a precomputed database of optimized circuits, generated with SAT solvers after carefully clustering Boolean functions with three inputs and up to three outputs. Second, we demonstrate that it is sufficient to check a linear number of subcircuits, relative to the size of the original circuit. This allows a single iteration of the tool to be executed in linear time. We evaluated the tool on a wide range of Boolean circuits, including both industrial and hand-crafted examples, in two popular formats: AIG and BENCH. For AIG circuits, after applying the state-of-the-art ABC framework, our tool achieved an additional 4% average reduction in size. For BENCH circuits, the tool reduced their size by an average of 30%. |
| title | Simplifier: A New Tool for Boolean Circuit Simplification |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2503.19103 |