1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Decision Tree to DNF proof

  1. Jan 30, 2013 #1
    1. The problem statement, all variables and given/known data

    How can we proof that a decision tree can be written as a DNF?

    2. Relevant equations


    A boolean form made of literals (X1 and X2 and X3) or'ed with other literals f = ( (X1 and X2 and X3) or (X4 and X5 and X6) )

    3. The attempt at a solution

    I am able to take a decision tree and turn it into a DNF but I am not sure how to prove that any tree can be turned into a DNF. I would love some help to get started.
    Last edited: Jan 31, 2013
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?

Similar Discussions: Decision Tree to DNF proof
  1. A proof! (Replies: 0)

  2. Decision Analysis (Replies: 0)