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

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Fuzzy inequational logic

  • Original language description

    We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes their semanticentailment and provability in graded setting which allows to draw partially true conclusions from partially true assumptions. We follow the Pavelka approach and define general degrees of semantic entailment and provability using complete residuated lattices as structures of truth degrees. We prove the logic is Pavelka-style complete. Furthermore, we present a logic for reasoning about graded if-then rules which is obtained as particular case of the general result.

  • 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

    <a href="/en/project/GA14-11585S" target="_blank" >GA14-11585S: Relational Similarity-Based Databases</a><br>

  • 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

    International Journal of Approximate Reasoning

  • ISSN

    0888-613X

  • e-ISSN

  • Volume of the periodical

    60

  • Issue of the periodical within the volume

    MAY

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    14

  • Pages from-to

    23-36

  • UT code for WoS article

    000353855900003

  • EID of the result in the Scopus database