Tri-based set operations and selective computation of prime implicates

Authors:
Andrew Matusiewicz;Neil V. Murray;Erik Rosenthal
Affiliations:
Institute for Informatics, Logics & Security Studies, Department of Computer Science, University at Albany-SUNY, Albany, NY;Institute for Informatics, Logics & Security Studies, Department of Computer Science, University at Albany-SUNY, Albany, NY;Institute for Informatics, Logics & Security Studies, Department of Computer Science, University at Albany-SUNY, Albany, NY
Venue:
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Year:
2011

Citing 15
Cited 0

An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
Implicit and incremental computation of primes and essential primes of Boolean functions

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Polynomial-time algorithms for generation of prime implicants

Journal of Complexity
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning
Computing Prime Implicants

Proceedings of the 10th International Conference on Automated Deduction
Computing Prime Implicates Incrementally

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Computation of Prime Implicates and Prime Implicants by a variant of the Davis and Putnam Procedure

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Prime Implicant Computation Using Satisfiability Algorithms

ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Logic synthesis for vlsi design

Logic synthesis for vlsi design
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers
Combining Syntax and Semantics through Prime Form Representation

Journal of Logic and Computation
A new algorithm for incremental prime implicate generation

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Prime Implicate Tries

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Implementing iterated belief change via prime implicates

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
An improved incremental algorithm for generating prime implicates

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A more efficient version of the prime implicate algorithm introduced in that reduces the use of subsumption is presented. The algorithm is shown to be easily tuned to produce restricted sets of prime implicates. Experiments that illustrate these improvements are described.