Fuzzy logic programming reduced to reasoning with attribute implications

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F15%3A33155444" target="_blank" >RIV/61989592:15310/15:33155444 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S0165011414001882" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0165011414001882</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.fss.2014.04.013" target="_blank" >10.1016/j.fss.2014.04.013</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Fuzzy logic programming reduced to reasoning with attribute implications

Popis výsledku v původním jazyce

We present a link between two types of logic systems for reasoning with graded if-then rules: the system of fuzzy logic programming (FLP) in sense of Vojtáš and the system of fuzzy attribute logic (FAL) in sense of Belohlavek and Vychodil. We show that each finite theory consisting of formulas of FAL can be represented by a definite program so that the semantic entailment in FAL can be characterized by correct answers for the program. Conversely, we show that for each definite program there is a collection of formulas of FAL so that the correct answers can be represented by the entailment in FAL. Using the link, we can transport results from FAL to FLP and vice versa which gives us, e.g., a syntactic characterization of correct answers based on Pavelka-style Armstrong-like axiomatization of FAL. We further show that entailment in FLP is reducible to reasoning with Boolean attribute implications and elaborate on related issues including properties of least models.

Název v anglickém jazyce

Fuzzy logic programming reduced to reasoning with attribute implications

Popis výsledku anglicky

We present a link between two types of logic systems for reasoning with graded if-then rules: the system of fuzzy logic programming (FLP) in sense of Vojtáš and the system of fuzzy attribute logic (FAL) in sense of Belohlavek and Vychodil. We show that each finite theory consisting of formulas of FAL can be represented by a definite program so that the semantic entailment in FAL can be characterized by correct answers for the program. Conversely, we show that for each definite program there is a collection of formulas of FAL so that the correct answers can be represented by the entailment in FAL. Using the link, we can transport results from FAL to FLP and vice versa which gives us, e.g., a syntactic characterization of correct answers based on Pavelka-style Armstrong-like axiomatization of FAL. We further show that entailment in FLP is reducible to reasoning with Boolean attribute implications and elaborate on related issues including properties of least models.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2015

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

Fuzzy Sets and Systems

ISSN

0165-0114

e-ISSN

—

Svazek periodika

262

Číslo periodika v rámci svazku

MAR

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

20

Strana od-do

1-20

Kód UT WoS článku

000347103900001

EID výsledku v databázi Scopus

—