Automated prover for attribute dependencies in data with grades

Kód výsledku v IS VaVaI

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

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Automated prover for attribute dependencies in data with grades

Popis výsledku v původním jazyce

We present a new axiomatization of logic for dependencies in data with grades, which includes ordinal data and data over domains with similarity relations, and an efficient reasoning method that is based on the axiomatization. The logic has its ordinary-style completeness characterizing the ordinary, bivalent entailment as well as the graded style completeness characterizing the general, possibly intermediate degrees of entailment. A core of the method is a new inference rule, called the rule of simplification, from which we derive convenient equivalences that allow us to simplify sets of dependencies while retaining semantic closure. The method makes it possible to compute a closure of a given collection of attributes with respect to a collection of dependencies, decide whether a given dependency is entailed by a given collection of dependencies, and more generally, compute the degree to which the dependency is entailed by a collection of dependencies. We also present an experimental evaluation of the presented method.

Název v anglickém jazyce

Automated prover for attribute dependencies in data with grades

Popis výsledku anglicky

We present a new axiomatization of logic for dependencies in data with grades, which includes ordinal data and data over domains with similarity relations, and an efficient reasoning method that is based on the axiomatization. The logic has its ordinary-style completeness characterizing the ordinary, bivalent entailment as well as the graded style completeness characterizing the general, possibly intermediate degrees of entailment. A core of the method is a new inference rule, called the rule of simplification, from which we derive convenient equivalences that allow us to simplify sets of dependencies while retaining semantic closure. The method makes it possible to compute a closure of a given collection of attributes with respect to a collection of dependencies, decide whether a given dependency is entailed by a given collection of dependencies, and more generally, compute the degree to which the dependency is entailed by a collection of dependencies. We also present an experimental evaluation of the presented method.

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/EE2.3.20.0059" target="_blank" >EE2.3.20.0059: Reintegrace českého vědce a vytvoření špičkového týmu v informačních vědách</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

International Journal of Approximate Reasoning

ISSN

0888-613X

e-ISSN

—

Svazek periodika

70

Číslo periodika v rámci svazku

MAR

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

17

Strana od-do

51-67

Kód UT WoS článku

000369459900004

EID výsledku v databázi Scopus

2-s2.0-84962190119