RT journal article
T1 Fuzzy logic programs as hypergraphs. Termination results ?
A1 Díaz Moreno, Juan Carlos
A1 Medina Moreno, Jesús
A1 Portillo, José R.
A2 Matemáticas
K1 Logic programming
K1 Fuzzy sets
K1 Termination
K1 Hypergraphs
AB Graph theory has been a useful tool for logic programming in many aspects. In this paper, we propose an equivalent representation of multi-adjoint logic programs using hypergraphs, which are a generalization of classical graphs that allows the use of hypergraph theory in logic programming. Specifically, this representation has been considered in this paper to increase the level and flexibility of different termination results of the computation of the least model of fuzzy logic programs via the immediate consequence operator. Consequently, the least model of more general and versatile fuzzy logic programs can be obtained after finitely many iterations, although infinite programs or programs with loops and general aggregators will be considered. (c) 2022 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
PB ELSEVIER
SN 0165-0114
YR 2022
FD 2022-09
LK http://hdl.handle.net/10498/27310
UL http://hdl.handle.net/10498/27310
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 22-sep-2026