title: Boolean expression solver/simplifier
body: <p>I am looking for an Boolean expression solver for very big (but not complex) algebra like:
  <a href="http://www.elektroniker-bu.de/boolesche.htm" rel="nofollow">Boolsche Ausdrücke vereinfachen (Axiome)</a>
  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:</p>
  
  <pre><code>a &amp;&amp; ~a -&gt; 0
  
  a || a &amp;&amp; (b || c) -&gt; a
  </code></pre>
  
  <p>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.</p>
  
  <p><strong>Edit:</strong>
  If I write it my self, I could use Javaluator and evaluate.
  When I have: <code>(adb+c) &amp;&amp; d</code> I would like to start with multiply out. Anyone an idea?</p>