An algorithm for bi-decomposition of logic functions
Proceedings of the 38th annual Design Automation Conference
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Proceedings of the 45th annual Design Automation Conference
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Bi-decomposition of large Boolean functions using blocking edge graphs
Proceedings of the International Conference on Computer-Aided Design
Quantified maximum satisfiability: a core-guided approach
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Boolean function bi-decomposition is ubiquitous in logic synthesis. It entails the decomposition of a Boolean function using two-input simple logic gates. Existing solutions for bi-decomposition are often based on BDDs and, more recently, on Boolean Satisfiability. In addition, the partition of the input set of variables is either assumed, or heuristic solutions are considered for finding good partitions. In contrast to earlier work, this paper proposes the use of Quantified Boolean Formulas (QBF) for computing bi-decompositions. These bi-decompositions are optimal in terms of the achieved quality of the input set of variables. Experimental results, obtained on representative benchmarks, demonstrate clear improvements in the quality of computed decompositions, but also the practical feasibility of QBF-based bi-decomposition.