Product-of-Sums (POS) Solver
Get the minimal product-of-sums expression for any Boolean function, computed by minimizing the zeros of the function and applying De Morgan's theorem.
Why use this product-of-sums (pos) solver
Correct De Morgan conversion
POS terms are derived properly from the complement function's minimized groups, not guessed from the SOP result.
Useful for OR-AND circuits
POS is the natural form when a circuit is built from OR gates feeding into a single AND gate.
Compare against SOP instantly
Toggle between SOP and POS for the same input to see which form is actually smaller for your function.
Frequently asked questions
What does POS mean?
Product-of-sums: an expression written as AND'd-together OR terms, e.g. F = (A+B)(A'+C) — implemented with OR gates feeding a final AND gate.
How is POS calculated from a K-map?
By grouping the 0s (rather than the 1s) exactly like a normal SOP minimization, then applying De Morgan's theorem to convert each resulting term into a sum.
When is POS preferred over SOP?
When the zeros of a function group into fewer or larger terms than the ones do — this varies function by function, which is why comparing both is useful.