We propose effective algorithms for exact synthesis of Boolean logic networks using
satisfiability modulo theories (SMTs) solvers. Since exact synthesis is a difficult problem, it …

The paper presents a generalization of DAG-aware AIG rewriting for k-feasible Boolean
networks, whose nodes are k-input lookup tables (k-LUTs). We introduce a high-effort DAG …

This paper presents a rewriting method for Boolean circuits that minimizes small subcircuits
with exact synthesis. Individual synthesis tasks are encoded as Quantified Boolean …

Exact synthesis is a versatile logic synthesis technique with applications to logic
optimization, technology mapping, synthesis for emerging technologies, and cryptography …

Automatic synthesis of hardware components from declarative specifications is an ambitious
endeavor in computer aided design. Existing synthesis algorithms are often implemented …

Adiabatic quantum-flux-parametron (AQFP) circuits are a family of superconducting
electronic (SCE) circuits that have recently gained growing interest due to their low-energy …

Logic synthesis is an enabling technology to realize integrated computing systems, and it
entails solving computationally intractable problems through a plurality of heuristic …

SAT based exact synthesis is a powerful technique, with applications in logic optimization,
technology mapping, and synthesis for emerging technologies. However, its runtime …

Most logic synthesis algorithms work on graph representations of logic functions with nodes
associated with arbitrary logic expressions or simple logic functions and iteratively optimize …

We apply and evaluate polynomial-time algorithms to compute two different normal forms of
propositional formulas arising in verification. One of the normal form algorithms is presented …