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;
a lightweight algorithm for a possible pre-processing of the data; and
a suit of three post-processing algorithms for
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,
the set-based comparison of and operation on rulebases, and
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.