Computation of Prime Implicates and Prime Implicants by a variant of the Davis and Putnam Procedure

Authors:
Thierry Castell
Affiliations:
-
Venue:
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Year:
1996

Citing 0
Cited 5

Consistency restoriation and explanations in dynamic CSPs----application to configuration

Artificial Intelligence
A survey on knowledge compilation

AI Communications
On propositional definability

Artificial Intelligence
Tri-based set operations and selective computation of prime implicates

ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem is the transformation of a conjonctive normal form (CNF) into a minimized (for the set inclusion operator) disjunctive normal form (DNF) and reciprocally. This operation is called the unionist product. For a CNF (resp. DNF), one pass of the unionist product provides the prime implicants (resp. prime implicates); two passes provide the prime implicates (resp. prime 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.