Please use this identifier to cite or link to this item: http://hdl.handle.net/11717/6770
Title: Computing prime implicants via transversal clauses
Authors: Singh, A.
Keywords: Algorithms
Knowledge representation
Parallel processing systems
Prime implicants
Transversal clauses
Computation theory
Issue Date: 1999
Publisher: Gordon & Breach Science Publ Inc, Newark, NJ, United States
Citation: International Journal of Computer Mathematics, 70(3), 417-427
Abstract: In this paper, the notion of transversal clauses is introduced and subsequently a new algorithm for computing prime implicants is developed. Opposed to the common approach of computing prime implicants of a dnf, the proposed algorithm uses a cnf representation of a propositional formula. The same algorithm applied on a dnf representation yields the set of prime implicates of a formula. Besides its suitability for implementation in a parallel environment and as an incremental algorithm, it has been found to work faster in case, the number of prime implicants is large.
URI: http://hdl.handle.net/11717/6770
ISSN: 207160
Appears in Collections:Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.