Documentation: In which sense is simplified dnf minimal?

[jachymb]

I run sympy.logic.boolalg.to_dnf(expr, simplify=True) to get the simplest dnf formula for expr. However, the documentation does not tell in which sense is the resulting formula minimal. There are more conceivable minimization criteria which may yield different results, e.g.

• simply the total number of literals (not preferable for me)
• the total number of literals when the number of terms is minimized first
• the maximal number of literals in a term when the number of terms is minimized first
  I would like to know and the documentation should be updated.

[asmeurer]

It uses simplify_logic, though the docs for it aren't very clear either.

[oscargus]

simplify_logic uses SOPform and POSform that returns the smallest two-level And-Or or Or-And expression. With smallest meaning minimum number of terms, where each term has as few terms as possible. Quine-McCluskey/Karnaughmap style.

The docs can be clearer though.