Representing Fuzzy Logic Programs by Graded Attribute Implications

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F12%3A33141173" target="_blank" >RIV/61989592:15310/12:33141173 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Representing Fuzzy Logic Programs by Graded 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 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 offormulas 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-styleArmstrong-like axiomatization of FAL.

Název v anglickém jazyce

Representing Fuzzy Logic Programs by Graded 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 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 offormulas 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-styleArmstrong-like axiomatization of FAL.

Druh

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

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

O - Projekt operacniho programu

Rok uplatnění

2012

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

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Svazek periodika

7647

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

12

Strana od-do

246-257

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—