1. PF Contest - Win "Conquering the Physics GRE" book! Click Here to Enter
    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?
Draft saved Draft deleted

Similar Threads - Decision Tree proof Date
Linear Programming Case Study - Case Problem Mar 29, 2016
Differential equation tree height Mar 8, 2016
Decision Boundary Line (Linear/Non-Linear) Nov 20, 2013
What is decision problem? Jun 30, 2012
Decision Analysis Feb 18, 2011