Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form
نویسندگان
چکیده
In this paper, a new approach for enumerating the set prime implicants (PI) of a Boolean formula in conjunctive normal form (CNF) is proposed. It is based on an encoding of the input formula as a new one whose models correspond to the set of prime implicants of the original theory. This first PI enumeration approach is then enhanced by an original use of the boolean functions or gates usually involved in many CNF instances encoding real-world problems. Experimental evaluation on several classes of CNF instances shows the feasibility of our proposed framework.
منابع مشابه
Prime Compilation of Non-Clausal Formulae
Formula compilation by generation of prime implicates or implicants finds a wide range of applications in AI. Recent work on formula compilation by prime implicate/implicant generation often assumes a Conjunctive/Disjunctive Normal Form (CNF/DNF) representation. However, in many settings propositional formulae are naturally expressed in non-clausal form. Despite a large body of work on compilat...
متن کاملComputation of Prime Implicants Using Matrix and Paths
In this paper, an efficient algorithm to compute the set of prime implicants of a prepositional formula in Conjunc-tive Normal Form (CNF) is presented. The proposed algorithm uses a concept of representing the formula as a bi-nary matrix and computing paths through the matrix as implicants. The algorithm finds the prime implicants as theprime paths using the divide-and-conquer techn...
متن کاملLength of Prime Implicants and Number of Solutions of Random CNF Formulae
Consider a uniform distribution of r-CNF formulae (in Conjunctive Normal Form) with cn clauses, each with r distinct literals, over a set of n variables. A prime implicant Y of a formula @ is a consistent conjunction of literals which implies @ but ceases to imply when deprived of any one literal. The normalized length of 9 is the ratio of the number of its literals to the number of variables o...
متن کاملPropositional Fragments for Knowledge Compilation and Quantified Boolean Formulae
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like inference, diagnosis and planning); among them are the (quite influential) ordered binary decision diagrams, prime implicates, prime implicants, “formulae” in decomposable negation normal form. On the other hand, the valid...
متن کاملComplexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like inference, diagnosis and planning); among them are the ordered binary decision diagrams, prime implicates, prime implicants, “formulae” in decomposable negation normal form. On the other hand, the validity problem val(QPRO...
متن کامل