Abstract
This article presents a new heuristic algorithm for conceptual learning. The process of constructing a decision tree through the minimization of a logical function is explained. This heuristic approach eliminates the need to expand the inverse property space into a full logical expression, which could be computationally expensive for large expressions. Tests were conducted using various sets of standardized machine learning benchmarks. They show that the algorithm operates with high precision and accuracy on noise-free data as well as on datasets that include noise through the presence of mislabeled examples. The algorithm’s ability to capture non-linear patterns was experimentally evaluated, where the target class is defined by the equality of two specified attributes. The application of the proposed algorithm for the creation of hybrid neuro-symbolic architectures is discussed, with the aim of achieving logically grounded and interpretable machine learning and machine reasoning.

This publication has 10 references indexed in Scilit: