1. clicking on the backup button and
2. copy-pasting the content of the pop-up dialog into a file or message.

1. clicking on the restore button,
2. copy-pasting the stored content into the pop-up dialog, and
3. clicking the "OK"-button of the dialog window.

1. an optimal algorithm for the automatic extraction as a rulebase and structured visualisation as a rule diagram of a sound, thus consistent, and complete set of constructive predicate reasoning rules (implicational invariants) from arbitrary tabular data;
2. a lightweight algorithm for a possible pre-processing of the data; and
3. a suit of three post-processing algorithms for
   1. the calculation of the complete set of consequences (deductive closure) that can be deduced from the extracted rules under a user-input finite set of elementary hypotheses by means of modus ponens,
   2. the set-based comparison of and operation on rulebases, and
   3. the model-checking of an existing input data table and rulebase including the visualisation of the check as a satisfaction table.

As a desirable side effect, Algorithm 1 also extracts and visualises a complete set of quantitatively qualified, fuzzy (not invariant) reasoning rules from its input data.

• PROCESSING SELECTION
  • PRE- AND MAIN PROCESSING
    • RULE VISUALISATION
    • RULE DISTILLATION
  • POST-PROCESSING
    • RULE-BASE VISUALISER
    • CALCULATOR MODULES
      • CONSEQUENCE CALCULATOR
      • HYPOTHESIS CALCULATOR
      • DISTANCE CALCULATOR
      • SET CALCULATOR
    • MODEL CHECKER
  • SPECIAL-PURPOSE PROCESSING
    • BINARY-FILE ANALYSER
    • COMPLEMENTARITY CALCULATOR