Fuzzy logic programs as hypergraphs. Termination results

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. Specifica...

Full description

Saved in:
Bibliographic Details
Published inFuzzy sets and systems Vol. 445; pp. 22 - 42
Main Authors Díaz-Moreno, Juan Carlos, Medina, Jesús, Portillo, José R.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 20.09.2022
Subjects
Fuzzy sets
Hypergraphs
Logic programming
Termination
Fuzzy sets
Termination
Logic programming
Hypergraphs
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0165-0114
1872-6801
DOI:10.1016/j.fss.2022.02.001