Karnaugh Maps are a tool used to help minimize small boolean logic circuits. By converting a truth table to a series of "k"-maps indexed by gray codes in order to relate the effect of each individual change to the inputs on a given output (one map for each output), you can easily identify redundant terms in a naive boolean representation of the table, and remove unneeded logic.
To use this program, paste a whitespace-formatted truth table into the text entry area, select the number of inputs in the truth table, and click calculate to see its associated kmaps. The required table format is pretty much common sense, and will be properly generated if you're pasting from a spreadsheet.
Source is available on GitLab