SAT-based Circuit Local Improvement

by   Alexander S. Kulikov, et al.

Finding exact circuit size is a notorious optimization problem in practice. Whereas modern computers and algorithmic techniques allow to find a circuit of size seven in blink of an eye, it may take more than a week to search for a circuit of size thirteen. One of the reasons of this behavior is that the search space is enormous: the number of circuits of size s is s^Θ(s), the number of Boolean functions on n variables is 2^2^n. In this paper, we explore the following natural heuristic idea for decreasing the size of a given circuit: go through all its subcircuits of moderate size and check whether any of them can be improved by reducing to SAT. This may be viewed as a local search approach: we search for a smaller circuit in a ball around a given circuit. We report the results of experiments with various symmetric functions.



There are no comments yet.


page 1

page 3

page 5

page 7

page 9

page 11

page 12

page 13


Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms

We continue the program of proving circuit lower bounds via circuit sati...

The PSPACE-hardness of understanding neural circuits

In neuroscience, an important aspect of understanding the function of a ...

Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability

This work focuses on improving state-of-the-art in stochastic local sear...

Simulation-Guided Boolean Resubstitution

This paper proposes a new logic optimization paradigm based on circuit s...

A Circuit-Level Amoeba-Inspired SAT Solver

AmbSAT is a biologically-inspired stochastic local search (SLS) solver t...

Circuit Complexity of Visual Search

We study computational hardness of feature and conjunction search throug...

GA and ILS for optimizing the size of NFA models

Grammatical inference consists in learning a formal grammar (as a set of...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.