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 sets of graded attribute implications with witnessed non-redundancy

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F16%3A33160393" target="_blank" >RIV/61989592:15310/16:33160393 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    On sets of graded attribute implications with witnessed non-redundancy

  • Original language description

    We study properties of particular non-redundant sets of if-then rules describing dependencies between graded attributes. The semantics of the considered rules is parameterized by linguistic hedges. In the setting of general idempotent truth-stressing hedges, we introduce notions of saturation and witnessed non-redundancy of sets of graded attribute implications. Furthermore, we show that bases of graded attribute implications given by systems of pseudo-intents correspond to non-redundant sets of graded attribute implications with saturated consequents where the non-redundancy is witnessed by antecedents of the contained graded attribute implications. For the special case of graded attribute implications parameterized by globalization, we introduce an algorithm which transforms any complete set of if-then rules into a base given by pseudo-intents. Experimental evaluation is provided to compare the method of obtaining bases with earlier graph-based approaches.

  • 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

    2016

  • 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

    Information Sciences

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    329

  • Issue of the periodical within the volume

    FEB

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    13

  • Pages from-to

    434-446

  • UT code for WoS article

    000367485000027

  • EID of the result in the Scopus database

    2-s2.0-84983191348