Covering of minimal solutions to fuzzy relational equations

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73607804" target="_blank" >RIV/61989592:15310/21:73607804 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.tandfonline.com/doi/full/10.1080/03081079.2020.1865340" target="_blank" >https://www.tandfonline.com/doi/full/10.1080/03081079.2020.1865340</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1080/03081079.2020.1865340" target="_blank" >10.1080/03081079.2020.1865340</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Covering of minimal solutions to fuzzy relational equations

Popis výsledku v původním jazyce

A minimal solution to a fuzzy relational equation is, loosely speaking, a solution such that the values of all its elements cannot be decreased. To find some minimal solution is simple - one can just identify the greatest solution to the equation and then lower the values of all its elements as much as possible. However, finding all minimal solutions is significantly more difficult since when decreasing the values one needs to go through all combinations of the elements. The paper shows that when considering an n-element scale of truth values equipped with Lukasiewicz or Goguen operations, the set of all minimal solutions can be represented by constrained solutions which allows to skip a considerable amount of these combinations.

Název v anglickém jazyce

Covering of minimal solutions to fuzzy relational equations

Popis výsledku anglicky

A minimal solution to a fuzzy relational equation is, loosely speaking, a solution such that the values of all its elements cannot be decreased. To find some minimal solution is simple - one can just identify the greatest solution to the equation and then lower the values of all its elements as much as possible. However, finding all minimal solutions is significantly more difficult since when decreasing the values one needs to go through all combinations of the elements. The paper shows that when considering an n-element scale of truth values equipped with Lukasiewicz or Goguen operations, the set of all minimal solutions can be represented by constrained solutions which allows to skip a considerable amount of these combinations.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

INTERNATIONAL JOURNAL OF GENERAL SYSTEMS

ISSN

0308-1079

e-ISSN

—

Svazek periodika

50

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

22

Strana od-do

117-138

Kód UT WoS článku

000611634800001

EID výsledku v databázi Scopus

2-s2.0-85099768820