Computing sets of graded attribute implications with witnessed non-redundancy

Kód výsledku v IS VaVaI

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

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Computing sets of graded attribute implications with witnessed non-redundancy

Popis výsledku v původním jazyce

In this paper we extend our previous results on sets of graded attribute implications with witnessed non-redundancy. We assume finite residuated lattices as structures of truth degrees and use arbitrary idempotent truth-stressing linguistic hedges as parameters which influence the semantics of graded attribute implications. In this setting, we introduce algorithm which transforms any set of graded attribute implications into an equivalent non redundant set of graded attribute implications with saturated consequents whose non redundancy is witnessed by antecedents of the formulas. As a consequence, we solve the open problem regarding the existence of general systems of pseudo-intents which appear in formal concept analysis of object-attribute data with graded attributes and linguistic hedges. Furthermore, we show a polynomial-time procedure for determining bases given by general systems of pseudo-intents from sets of graded attribute implications which are complete in data

Název v anglickém jazyce

Computing sets of graded attribute implications with witnessed non-redundancy

Popis výsledku anglicky

In this paper we extend our previous results on sets of graded attribute implications with witnessed non-redundancy. We assume finite residuated lattices as structures of truth degrees and use arbitrary idempotent truth-stressing linguistic hedges as parameters which influence the semantics of graded attribute implications. In this setting, we introduce algorithm which transforms any set of graded attribute implications into an equivalent non redundant set of graded attribute implications with saturated consequents whose non redundancy is witnessed by antecedents of the formulas. As a consequence, we solve the open problem regarding the existence of general systems of pseudo-intents which appear in formal concept analysis of object-attribute data with graded attributes and linguistic hedges. Furthermore, we show a polynomial-time procedure for determining bases given by general systems of pseudo-intents from sets of graded attribute implications which are complete in data

Druh

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

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA14-11585S" target="_blank" >GA14-11585S: Relační podobnostní databáze</a><br>

Návaznosti

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

Rok uplatnění

2016

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

Information Sciences

ISSN

0020-0255

e-ISSN

—

Svazek periodika

351

Číslo periodika v rámci svazku

JUL

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

11

Strana od-do

90-100

Kód UT WoS článku

000374078500007

EID výsledku v databázi Scopus

2-s2.0-84962325170