This work evaluates the use of Decision Trees (DTs) methods for a fast logic minimization of Boolean functions. The proposed DT approach is compared to traditional Espresso logic minimizer and the ABC tool, with respect to time, number of nodes and logic levels. The DT methods proved to be a faster alternative, reducing time by an average of 52% and 5.5% when compared to Espresso and ABC respectively, while keeping competitive results in terms of AIG depth and number of nodes. We also tested DTs with limited tree depth to obtain smaller circuits, for approximate results. The trade-offs between time, circuit area and accuracy are also discussed, and we managed to obtain reduced results in terms of time, AIG depth and number of nodes when compared to ABC, while maintaining acceptable accuracy results.