Boolean expression solver/simplifier
I am looking for an Boolean expression solver for very big (but not complex) algebra like: Boolsche Ausdrücke vereinfachen (Axiome) I would like to have some code (c++ or java [or libraries]) to simplify huge boolean expression. I haven´t found something. I just want to do some "simply" convertion like: a && ~a -> 0 a || a && (b || c) -> a But much longer. And I want to use symbolics (a, b, c1, d1..) not TRUE, FALSE, 0 or 1 at the moment. Thank you in advance. Edit: If I write it my self, I could use Javaluator and evaluate. When I have: (adb+c) && d I would like to start with multiply out.