AngouriMath

Navigation

Home Quick start Wiki Almanac Research What's new Try Use Angouri.org GitHub Report a bug Donate Contacts

AngouriMath.Functions.Boolean

← Back to list of namespaces

Classes within the AngouriMath.Functions.Boolean namespace

• BooleanSolver

  Summary

  This is set of very simple algorithms
  It's an analogue of Newton Solver as it doesn't represent its answer
  symbolically
  Use
  

• Minimiser

  Summary

  Two-level minimisation of a boolean expression by Quine-McCluskey: the minterms where
  it holds are combined into prime implicants, and a cover is chosen from those.
  

  Remarks

  The rewrite rules reach absorption and nothing past it, so
  a and b or a and not b stopped at a and (b or not b) -- the factoring is
  right and there is no rule to finish it, because b or not b has none reducing it
  to true. One classical algorithm covers that, excluded middle, non-contradiction
  and every larger cover at once, where each would otherwise be its own rule.
  #768