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”

On Finitely-valued Fuzzy Description Logics

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F14%3A33151235" target="_blank" >RIV/61989592:15310/14:33151235 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Finitely-valued Fuzzy Description Logics

  • Original language description

    This paper deals with finitely-valued fuzzy description languages from a logical point of view. From recent results in Mathematical Fuzzy Logic and following P.Hájek's "Making Fuzzy Description Logics more general", we develop a Fuzzy Description Logic based on the fuzzy logic of a finite BL-chain. The constructors of the languages presented in this paper correspond to the connectives of that logic (containing an involutive negation, Monteiro-Baaz delta, truth constants and hedges). The paper addressesthe hierarchy of fuzzy attributive languages; knowledge bases and their reductions; reasoning tasks; and complexity. Our results regarding decidability together with a summary of the known results related to computational complexity are of particular interest. In Appendix B we also provide axiomatizations for expansions of the logic of a finite BL-chain considered in the paper.

  • 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/EE2.3.30.0041" target="_blank" >EE2.3.30.0041: POST-UP II.</a><br>

  • Continuities

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

Others

  • Publication year

    2014

  • 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

    55

  • Issue of the periodical within the volume

    9

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    27

  • Pages from-to

    1890-1916

  • UT code for WoS article

    000343853800005

  • EID of the result in the Scopus database