| Summary: | One of the main problems in representing information in the form of nonsystematic logic is the lack of flexibility, which leads to potential overfitting. Although nonsystematic logic improves the representation of the conventional <i>k</i> Satisfiability, the formulations of the first, second, and third-order logical structures are very predictable. This paper proposed a novel higher-order logical structure, named G-Type Random <i>k</i> Satisfiability, by capitalizing the new random feature of the first, second, and third-order clauses. The proposed logic was implemented into the Discrete Hopfield Neural Network as a symbolic logical rule. The proposed logic in Discrete Hopfield Neural Networks was evaluated using different parameter settings, such as different orders of clauses, different proportions between positive and negative literals, relaxation, and differing numbers of learning trials. Each evaluation utilized various performance metrics, such as learning error, testing error, weight error, energy analysis, and similarity analysis. In addition, the flexibility of the proposed logic was compared with current state-of-the-art logic rules. Based on the simulation, the proposed logic was reported to be more flexible, and produced higher solution diversity.
|
|---|