Computing 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%3A33160159" target="_blank" >RIV/61989592:15310/16:33160159 - isvavai.cz</a>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Computing sets of graded attribute implications with witnessed non-redundancy
Original language description
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
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
351
Issue of the periodical within the volume
JUL
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
11
Pages from-to
90-100
UT code for WoS article
000374078500007
EID of the result in the Scopus database
2-s2.0-84962325170