Funkcionální závislosti datových tabulek nad doménami s relacemi podobnosti

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F05%3A00002481" target="_blank" >RIV/61989592:15310/05:00002481 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Functional dependencies of data tables over domains with similarity relations

Popis výsledku v původním jazyce

We study attribute dependencies in a setting of fuzzy logic. Our dependencies are described by formulas $ARightarrow B$ where $A$ and $B$ are fuzzy sets of attributes. The meaning of $ARightarrow B$ is that any two objects that have similar values on attributes from $A$ have also similar values on attributes from $B$. Our approach generalizes classical functional dependencies from databases and also several approaches to functional dependencies in fuzzy databases. We show a connection to other interpretation of formulas $ARightarrow B$ which we studied before. Although the two interpretations are different, they have the same concept of semantic entailment. This connection enables us to find a complete axiomatization of reasoning with our attributedependencies. We prove completeness theorem in the usual as well as in a so-called graded style. The connection also enables us to compute a complete non-redundant basis of all functional dependencies which are true in a data table. We pr

Název v anglickém jazyce

Functional dependencies of data tables over domains with similarity relations

Popis výsledku anglicky

We study attribute dependencies in a setting of fuzzy logic. Our dependencies are described by formulas $ARightarrow B$ where $A$ and $B$ are fuzzy sets of attributes. The meaning of $ARightarrow B$ is that any two objects that have similar values on attributes from $A$ have also similar values on attributes from $B$. Our approach generalizes classical functional dependencies from databases and also several approaches to functional dependencies in fuzzy databases. We show a connection to other interpretation of formulas $ARightarrow B$ which we studied before. Although the two interpretations are different, they have the same concept of semantic entailment. This connection enables us to find a complete axiomatization of reasoning with our attributedependencies. We prove completeness theorem in the usual as well as in a so-called graded style. The connection also enables us to compute a complete non-redundant basis of all functional dependencies which are true in a data table. We pr

Druh

D - Stať ve sborníku

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

<a href="/cs/project/1ET101370417" target="_blank" >1ET101370417: Hierarchická analýza složitých dat</a><br>

Návaznosti

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

Rok uplatnění

2005

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 statě ve sborníku

Proceedings of 2nd Indian International Conference on Artificial Intelligence

ISBN

0-9727412-1-6

ISSN

—

e-ISSN

—

Počet stran výsledku

19

Strana od-do

2486-2504

Název nakladatele

Indian International Conference on Artificial Intelligence

Místo vydání

Pune, India

Místo konání akce

Pune, India

Datum konání akce

1. 1. 2005

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—