Formalization of Provenes fuzzy functional dependency in fuzzy databases.

Nedzad Dukic; Zikrija Avdagic

Mathware and Soft Computing (2004)

  • Volume: 11, Issue: 1, page 31-44
  • ISSN: 1134-5632

Abstract

top
In this paper we establish equivalence between a theory of fuzzy functional dependences and a fragment of fuzzy logic. We give a way to interpret fuzzy functional dependences as formulas in fuzzy logic. This goal is realized in a few steps. Truth assignment of attributes is defined in terms of closeness between two tuples in a fuzzy relation. A corresponding fuzzy formula is associated to a fuzzy functional dependence. It is proved that if a relation satisfies a fuzzy functional dependence, then the corresponding fuzzy formula is satisfied and viceverse. Finally, equivalence of a fuzzy formulas and a set fuzzy functional dependence is demonstrated. Thus we are in position to apply the rule of resolution from fuzzy logic, while calculating fuzzy functiorial dependences.

How to cite

top

Dukic, Nedzad, and Avdagic, Zikrija. "Formalization of Provenes fuzzy functional dependency in fuzzy databases.." Mathware and Soft Computing 11.1 (2004): 31-44. <http://eudml.org/doc/39258>.

@article{Dukic2004,
abstract = {In this paper we establish equivalence between a theory of fuzzy functional dependences and a fragment of fuzzy logic. We give a way to interpret fuzzy functional dependences as formulas in fuzzy logic. This goal is realized in a few steps. Truth assignment of attributes is defined in terms of closeness between two tuples in a fuzzy relation. A corresponding fuzzy formula is associated to a fuzzy functional dependence. It is proved that if a relation satisfies a fuzzy functional dependence, then the corresponding fuzzy formula is satisfied and viceverse. Finally, equivalence of a fuzzy formulas and a set fuzzy functional dependence is demonstrated. Thus we are in position to apply the rule of resolution from fuzzy logic, while calculating fuzzy functiorial dependences.},
author = {Dukic, Nedzad, Avdagic, Zikrija},
journal = {Mathware and Soft Computing},
keywords = {Lógica difusa; Bases de datos relacionales; fuzzy functional dependency; fuzzy logic; resolution},
language = {eng},
number = {1},
pages = {31-44},
title = {Formalization of Provenes fuzzy functional dependency in fuzzy databases.},
url = {http://eudml.org/doc/39258},
volume = {11},
year = {2004},
}

TY - JOUR
AU - Dukic, Nedzad
AU - Avdagic, Zikrija
TI - Formalization of Provenes fuzzy functional dependency in fuzzy databases.
JO - Mathware and Soft Computing
PY - 2004
VL - 11
IS - 1
SP - 31
EP - 44
AB - In this paper we establish equivalence between a theory of fuzzy functional dependences and a fragment of fuzzy logic. We give a way to interpret fuzzy functional dependences as formulas in fuzzy logic. This goal is realized in a few steps. Truth assignment of attributes is defined in terms of closeness between two tuples in a fuzzy relation. A corresponding fuzzy formula is associated to a fuzzy functional dependence. It is proved that if a relation satisfies a fuzzy functional dependence, then the corresponding fuzzy formula is satisfied and viceverse. Finally, equivalence of a fuzzy formulas and a set fuzzy functional dependence is demonstrated. Thus we are in position to apply the rule of resolution from fuzzy logic, while calculating fuzzy functiorial dependences.
LA - eng
KW - Lógica difusa; Bases de datos relacionales; fuzzy functional dependency; fuzzy logic; resolution
UR - http://eudml.org/doc/39258
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.