Computation of prime implicates and prime implicants by a variant of the Davis and Putnam procedure

摘要

The problem is the transformation of a conjunctive normal form (CNF) into a minimized (for the inclusion operator) disjunctive normal form (DNF) and vice versa. This operation is called the unionist product. For a CNF (resp. DNF), one pass of the unionist product provides the prime implicants (resp. implicates); two passes provide the prime implicates (resp. implicants). An algorithm built upon the classical Davis and Putnam procedure is presented for calculating, without the explicit minimization for the inclusion, this unionist product.