Two-level logic minimization: an overview

作者: 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.

参考文章(60)
Johan de Kleer, Raymond Reiter, Found ations of assumption-based truth maintenance systems: preliminary report national conference on artificial intelligence. pp. 183- 188 ,(1987)
O. Coudert, J. C. Madre, A logically complete reasoning maintenance system based on a logical constraint solver international joint conference on artificial intelligence. pp. 294- 299 ,(1991)
O. Coudert, J. C. Madre, A New Graph Based Prime Computation Technique Springer, Boston, MA. pp. 33- 57 ,(1993) , 10.1007/978-1-4615-3154-8_2
Michael C. Loui, Gianfranco Bilardi, The Correctness of Tison's Method for Generating Prime Implicants. Coordinated Science Laboratory, University of Illinois at Urbana-Champaign. ,(1982)
Nripendra U. Biswas, Introduction to logic and switching theory ,(1975)
Richard L. Rudell, Multiple-Valued Logic Minimization for PLA Synthesis Defense Technical Information Center. ,(1986) , 10.21236/ADA606736
Richard L. Rudell, Alberto Sangiovanni-Vincentelli, Logic synthesis for vlsi design University of California, Berkeley. ,(1989)
Robert K. Brayton, Patrick C. McGeer, Jagesh V. Sanghavi, Alberto L. Sangiovanni-Vincentelli, A New Exact Minimizer for Two-Level Logic Synthesis Springer, Boston, MA. pp. 1- 31 ,(1993) , 10.1007/978-1-4615-3154-8_1