Problem 1496. Disjunctive Normal Form

This problem is the companion to Problem 1484. In Boolean logic, a formula is in disjunctive normal form (DNF) if it is a disjunction of clauses, where each clause is a conjunction of literals. http://en.wikipedia.org/wiki/Disjunctive_normal_form

You are given a cell array list of literals present in each clause, whose literal-names are indicated by numbers. The index is -ve if it is to be negated. You are also given the truth value of these variables as a row vector.

Output the truth value of the proposition.

Ex (A & B) | (~B & C & ~D ) | (D & ~E) is true for A=C=D=true, B=E=false is represented as { [1 2] [-2 3 -4] [4 -5]} , [1 0 1 1 0] and this evaluates to true

The DNF disjuncts are not restricted to 3 variables (3DNF).

Problem 11) Prev: 1486 Next: