Minimize complete Boolean logic with dont-care conditions

Fix the source and permitted changes first

Choose paste or file mode and supply one complete strict UTF-8 JSON. expression is the original function, dontCare describes ignorable inputs, and form is dnf, cnf or both. Omitted dontCare means False. File mode reads exactly one original File; paste mode reads only active text. One leading source UTF-8 BOM is supported and retained byte for byte in the original.

Names are case-sensitive ASCII identifiers. Use ~A or !A for NOT, & for AND, ^ for XOR and | for OR. Precedence is NOT, AND, XOR, OR; add parentheses deliberately. Code, functions, numeric comparisons and shifts are outside this grammar.

{
  "expression": "(A & B) | (A & C)",
  "dontCare": "False",
  "form": "both"
}

• Select the input mode before running, then check that its complete text or original File is the source you intend to process.
• Keep dontCare as False when every input must stay equivalent; change it only when you can state which rows may change.
• Choose the required form in the JSON, then verify each requested form is complete before saving its expression, report and diagram.

Check care conditions and mask identity

A row where dontCare=true permits a changed output. Every care row, where dontCare=false, must match the original. Variables are the union of both expressions sorted by ASCII; a variable omitted by the result still remains in this mapping.

The example uses A, B and C: A is bit0/mask1, B bit1/mask2 and C bit2/mask4. Row mask3 is therefore A=1, B=1, C=0, with a true original output. Do not substitute another library’s bit-order convention.

Check the small exact-cost example

With dontCare=False, all eight rows of the synthetic function (A & B) | (A & C) are care. DNF has two AND terms with four literals; CNF is (B | C) & A, with two clauses and three literals. Compare term or clause count first, then literals for equal counts.

Changing the same function’s dontCare explicitly to ~A leaves four care rows with A=1. DNF can be B | C (two terms, two literals); CNF is (B | C) (one clause, two literals). Original A remains in the truth table and bit/mask mapping. Changed conditions require a new run.

Save the complete table, mappings and diagrams

Check the complete report state and each requested form’s completed exact state before saving. The truth CSV retains every row and original/DC/after values. The report retains all primes, selected cubes, masks, term/clause mappings and costs; a visible expression alone is insufficient.

Each requested form has one complete SVG with all variables, selected terms or clauses, literals and explicit NOT gates, and any constants connected to its selected cover. Original JSON is saved byte for byte, alongside effective settings and expression text. A bounded preview is separate from complete downloads and full report copy. Summary work is measured before result encoding; the single total-work budget also covers all later full encoding.

Recover and record deliberate revisions

Input limits are 64 KiB, 8 variables, 4,096 tokens and 1,000 combined AST nodes; parser and parentheses depths are each 64. At most 256 truth rows and 6,561 cubes. One 10,000,000-work budget includes parsing, complete evaluation, each cover search, checks, mappings, diagrams and full encoding.

One 60-second deadline includes reading, loading, Workers, callbacks, complete validation, cleanup and first publication. A limit or cancellation refuses the entire task, clears old success and publishes no partial or late output. Retry the same original and parameters in a fresh Worker; record any deliberate reduction. Complete files plus all full copy text are limited to 8 MiB, with a 256 MiB memory reservation budget.