[Karnaugh map](http://en.wikipedia.org/wiki/K-map) is a method to simplify Boolean algebra expressions in two different notations sum-of-products([DNF](http://en.wikipedia.org/wiki/Disjunctive_normal_form)) and product-of-sums([CNF](http://en.wikipedia.org/wiki/Conjunctive_normal_form)).
I need to find a minimized boolean expression in **[algebraic normal form (ANF)](http://en.wikipedia.org/wiki/Algebraic_normal_form)** for a truth table. Is there a solution? 

A solution is simplifying the boolean algebra expression in CNF or DNF then converting it to ANF. But is it minimized? 

Is there a software to convert CNF boolean algebra expressions to ANF?