All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Fuzzy logic programming reduced to reasoning with attribute implications

The result's identifiers

  • Result code in 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>

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Fuzzy logic programming reduced to reasoning with attribute implications

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Fuzzy Sets and Systems

  • ISSN

    0165-0114

  • e-ISSN

  • Volume of the periodical

    262

  • Issue of the periodical within the volume

    MAR

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    20

  • Pages from-to

    1-20

  • UT code for WoS article

    000347103900001

  • EID of the result in the Scopus database