RT Book, Section
T1 From computer algebra to discretized continuous logic
A1 Roanes Lozano, Eugenio
A1 Montero De Juan, Francisco Javier
A1 Hernando, A.
A1 Laita, L. M.
AB The aim of this paper is to present a new algebraic approach from computer algebra to a discretized continuous logic. It makes use of a previous model of p-valued logic (where p is a prime number) based on the use of Grobner bases of polynomial ideals. A five-valued logic (i.e., p = 5) with some modal operators has been considered as a compromise between precision and complexity of the polynomials involved. Therefore the continuous truth values are discretized into five intervals corresponding to the likelihood levels: impossible or very unlikely unlikely dubious probably almost sure or absolutely sure. It is therefore posible to obtain the likelihood level of any given logic formula. Moreover, it is possible to perform knowledge extraction and verification of small Rule Based Expert System whose knowledge is represented by this logic. An implementation in the computer algebra system Maple is included.
PB Universidad de Huelva, Servicio de Publicaciones
SN 978-84-92944-02-6
YR 2010
FD 2010
LK https://hdl.handle.net/20.500.14352/45576
UL https://hdl.handle.net/20.500.14352/45576
LA eng
NO Gobierno de España
NO Universidad Complutense de Madrid
DS Docta Complutense
RD 9 abr 2025