Plausible Reasoning in an Algorithm for Generation of Good Classification Tests

The paper is devoted to the application of the plausible reasoning principles to symbolic machine learning. It seems for us that the applications are essential and necessary to improve the efficiency of ML algorithms. Many such algorithms produce and use rules in the form of implication. The generation of these rules with respect to the object classes is discussed. Our classification rules are specific. Their premise part, called good closed tests (GCTs), should cover as many objects as possible. One of the algorithms of GCTs generation called NIAGARA is presented. The algorithm is revisited and new procedures based on plausible reasoning are proposed. Their correctness is proved in propositions. We use the following rules: implication, interdiction, inductive rules of extending current sets of goal-oriented objects, rules of pruning the domain of searching solution. They allow to rise the effectiveness of algorithms.