4.7 Article

Fuzzy logic programs as hypergraphs. Termination results ?

Journal

FUZZY SETS AND SYSTEMS
Volume 445, Issue -, Pages 22-42

Publisher

ELSEVIER
DOI: 10.1016/j.fss.2022.02.001

Keywords

Logic programming; Fuzzy sets; Termination; Hypergraphs

Funding

  1. ERDF Operational Programme
  2. State Research Agency (AEI) [PID2019-108991GB-I00]
  3. Department of Economy, Knowledge, Business
  4. University of the Regional Government of Andalusia [FEDER-UCA18-108612]
  5. European Cooperation in Science & Technology (COST) Action [CA17124]

Ask authors/readers for more resources

This paper proposes an equivalent representation of multi-adjoint logic programs using hypergraphs, which increases the level and flexibility of termination results in computing the least model of fuzzy logic programs.
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/).

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available