Abstract
Abstract We present a novel technique for converting a Boolean conjunctive normal form (CNF) into an orthogonal disjunctive normal form (DNF), aka exclusive sum of products. Our method (which will be pitted against a hardwired command from Mathematica) zooms in on the models of the CNF by imposing its clauses one by one. Clausal imposition invites parallelization, and wildcards beyond the common don’t-care symbol compress the output. The method is most efficient for few but large clauses. Generalizing clauses, one can in fact impose superclauses. By definition, superclauses are obtained from clauses by substituting each positive literal by an arbitrary conjunction of positive literals.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
