作者: Olivier Coudert
DOI: 10.1016/0167-9260(94)00007-7
关键词:
摘要: Abstract Fourty years ago Quine noted that finding a procedure computes minimal sum products for given propositional formula is very complex, even though formulas are fairly simple. Since this early work, problem, known as two-level logic minimization, has attracted much attention. It arises in several fields of computer science, e.g., synthesis, reliability analysis, and automated reasoning. This paper exposes the classical approach presents recent developments overcome limitations procedures proposed past. We show these new techniques yield minimizer 10 up to 50 times faster than previously best ones, able handle more complex functions.