Design of a Computable Approximate Reasoning Logic System for AI

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

The fuzzy logic reasoning based on the “If… then…” rule is not the inaccurate reasoning of AI against ambiguity because fuzzy reasoning is antilogical. In order to solve this problem, a redundancy theory for discriminative weight filtering containing six theorems and one M(1,2,3) model was proposed and the approximate reasoning process was shown, the system logic of AI handling ambiguity as an extension of the classical logic system was proposed. The system is a generalized dynamic logic system characterized by machine learning, which is the practical-application logic system of AI, and can effectively deal with practical problems including conflict, noise, emergencies and various unknown uncertainties. It is characterized by combining approximate reasoning and computing for specific data conversion through machine learning. Its core is data and calculations and the condition is “sufficient” high-quality training data. The innovation is that we proposed a discriminative weight filtering redundancy theory and designed a computable approximate reasoning logic system that combines approximate reasoning and calculation through machine learning to convert specific data. It is a general logic system for AI to deal with uncertainty. The study has significance in theory and practice for AI and logical reasoning research.

Cite

CITATION STYLE

APA

Liu, K., Li, Y., & Cui, R. (2022). Design of a Computable Approximate Reasoning Logic System for AI. Mathematics, 10(9). https://doi.org/10.3390/math10091447

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free