A novel way to build expert systems with infinite-valued attributes
-
Published:2024
Issue:2
Volume:9
Page:2938-2963
-
ISSN:2473-6988
-
Container-title:AIMS Mathematics
-
language:
-
Short-container-title:MATH
Author:
Hernando Antonio1, Galán-García José Luis2, Aguilera-Venegas Gabriel2
Affiliation:
1. Depto. de Sistemas Informáticos, E.T.S.I. de Sistemas Informáticos, Universidad Politécnica de Madrid, Madrid, Spain 2. Departamento de Matemática Aplicada, Escuela de Ingenierías Industriales, Universidad de Málaga, Málaga, Spain
Abstract
<abstract><p>An expert system is a computer program that uses the knowledge of an expert to solve problems in a specific domain. Expert systems are used in a wide variety of fields, such as medicine, financial diagnosis and engineering. The attributes of an expert system are the characteristics of the problems that the system can solve. In traditional expert systems, attributes typically have a finite number of possible values. However, in scenarios where an attribute can assume a value from an infinite (or significantly large finite) set, the expert system cannot be represented using propositional logic. Until now, no method had been identified to implement such a system on a Computer Algebra System. Here, we break new ground by presenting a model that not only addresses this gap but also provides a fresh perspective on previous results. In fact, these prior results can be viewed as specific instances within the broader framework of our proposed solution. In this paper, we put forth an algebraic approach for the development of expert systems capable of handling attributes with infinite values, thereby expanding the problem-solving capacity of these systems.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference29 articles.
1. A. Hernando, E. Roanes-Lozano, L. M. Laita, A polynomial model for logics with a prime power number of truth values, J. Autom. Reasoning, 46 (2011), 205–221. https://doi.org/10.1007/s10817-010-9191-0 2. J. Hsiang, Refutational Theorem Proving using Term-Rewriting Systems, Artif. Intell., 25 (1985), 255–300. 3. D. Kapur, P. Narendran, An Equational Approach to Theorem Proving in First-Order Predicate Calculus, In: Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), 2 (1985), 1146–1153. 4. J. Chazarain, A. Riscos, J. A. Alonso, E. Briales, Multivalued logic and Gröbner Bases with applications to modal logic, J. Symb. Comput., 11 (1991), 181–194. https://doi.org/10.1016/S0747-7171(08)80043-0 5. J. A. Alonso, E. Briales, Lógicas Polivalentes y Bases de Gröbner, In: C. Martin, ed., Actas del V Congreso de Lenguajes Naturales y Lenguajes Formales, University of Seville, Seville, 1995,307–315.
|
|