Heuristic switching expression simplification
ACM '68 Proceedings of the 1968 23rd ACM national conference
An Algorithm for the Automatic Approximate Minimization of Boolean Functions
IEEE Transactions on Computers
Irredundant disjunctive and conjunctive forms of a Boolean function
IBM Journal of Research and Development
An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
Composite Distributive Lattices as Annotation Domains for Mediators
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
A Proof Strategy Based on a Dual Representation
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
An Extension of the Clause Table Approach to Multi-Output Combinational Switching Networks
IEEE Transactions on Computers
Generation of Prime Implicants by Direct Multiplication
IEEE Transactions on Computers
A New Technique for the Fast Minimization of Switching Functions
IEEE Transactions on Computers
Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem
IEEE Transactions on Computers
An Algebra for Switching Circuits
IEEE Transactions on Computers
Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions
IEEE Transactions on Computers
Irredundant Normal Forms and Minimal Dependence Sets of a Boolean Function
IEEE Transactions on Computers
A Prime Implicant Algorithm with Factoring
IEEE Transactions on Computers
An algorithm for computing theory prime implicates in first order logic
International Journal of Information and Communication Technology
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Updating Reduced Implicate Tries
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Prime Implicates and Reduced Implicate Tries
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
A new algorithm for incremental prime implicate generation
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IEEE Transactions on Computers
MINI: a heuristic approach for logic minimization
IBM Journal of Research and Development
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
An algorithm to generate prime implicants and its application to the selection problem
Information Sciences: an International Journal
Identifying Prime Implicate Branches in Reduced Implicate Tries
Fundamenta Informaticae - Methodologies for Intelligent Systems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
A new algorithm for computing theory prime implicates compilations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A Local Selection Algorithm for Switching Function Minimization
IEEE Transactions on Computers
Tri-based set operations and selective computation of prime implicates
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
The hows, whys, and whens of constraints in itemset and rule discovery
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
| Hi-index | 15.01 |
This paper describes an algorithm which will generate all the prime implicants of a Boolean function. The algorithm is different from those previously given in the literature, and in many cases it is more efficient. It is proved that the algorithm will find all the prime implicants. The algorithm may possibly generate some nonprime implicants. However, using frequency orderings on literals, the experiments with the algorithm show that it usually generates very few ( possibly none) nonprime implicants. Furthermore, the algorithm may be used to find the minimal sums of a Boolean function. The algorithm is implemented by a computer program in the LISP language.