Problem 1496. Disjunctive Normal Form

Created by G K

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This problem is the companion to Problem</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1484\"><w:r><w:t>1484</w:t></w:r></w:hyperlink><w:r><w:t>. 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.</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Disjunctive_normal_form\"><w:r><w:t>http://en.wikipedia.org/wiki/Disjunctive_normal_form</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Output the truth value of the proposition.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Ex (A &amp; B) | (~B &amp; C &amp; ~D ) | (D &amp; ~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</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The DNF disjuncts are not restricted to 3 variables (3DNF).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Problem 11) Prev:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1486\"><w:r><w:t>1486</w:t></w:r></w:hyperlink><w:r><w:t> Next:</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This problem is the companion to Problem <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1484">1484</a>. 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. <a href = "http://en.wikipedia.org/wiki/Disjunctive_normal_form">http://en.wikipedia.org/wiki/Disjunctive_normal_form</a>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 trueThe DNF disjuncts are not restricted to 3 variables (3DNF).Problem 11) 
Prev: <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1486">1486</a>
Next:

Solve

Solution Stats

13 Solutions
11 Solvers

Last Solution submitted on Jan 01, 2019

Last 200 Solutions

Problem Comments

Problem Recent Solvers11

Problem Tags

logic math

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1496. Disjunctive Normal Form

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers11

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Problem 1496. Disjunctive Normal Form

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers11

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Players