2004, Vol. XI, Núm. 1 http://hdl.handle.net/2099/1651 2021-07-25T22:13:37Z An application of the theory of intutionistic fuzzy multigraphs http://hdl.handle.net/2099/3634 An application of the theory of intutionistic fuzzy multigraphs Atanassov, Krassimir T.; Papadopoulos, Basil K; Syropoulos, Apostolos In a recent paper by one of the authors it has been shown that there is a relationship between algebraic structures and labeled transition systems. Indeed, it has been shown that an algebraic structures can be viewed as labeled transition systems, which can also be viewed as multigraphs. In this paper, we extend this work by providing an estimation of the transition possibilities between vertices that are connected with multiarcs. 2007-10-03T10:54:10Z Atanassov, Krassimir T. Papadopoulos, Basil K Syropoulos, Apostolos In a recent paper by one of the authors it has been shown that there is a relationship between algebraic structures and labeled transition systems. Indeed, it has been shown that an algebraic structures can be viewed as labeled transition systems, which can also be viewed as multigraphs. In this paper, we extend this work by providing an estimation of the transition possibilities between vertices that are connected with multiarcs. Formalization of provenes fuzzy functional depandency in fuzzy databases http://hdl.handle.net/2099/3633 Formalization of provenes fuzzy functional depandency in fuzzy databases Dukić, Nedžad; Avdagić, Zikrija 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 vice verse. 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 functional dependences. 2007-10-03T10:40:30Z Dukić, Nedžad Avdagić, Zikrija 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 vice verse. 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 functional dependences. The estimation of electric power losses in electrical networks by fuzzy regression model using genetic algorithm http://hdl.handle.net/2099/3632 The estimation of electric power losses in electrical networks by fuzzy regression model using genetic algorithm Mogilenko, A V; Pavlyuchenko, D A This paper presents the comparative study for fuzzy regression model using linear programming, fuzzy regression model using genetic algorithms and standard regression model. The fuzzy and standard models were developed for estimation of electric power losses in electrical networks. Simulation was carried out with a tool developed in MATLAB. 2007-10-03T10:29:32Z Mogilenko, A V Pavlyuchenko, D A This paper presents the comparative study for fuzzy regression model using linear programming, fuzzy regression model using genetic algorithms and standard regression model. The fuzzy and standard models were developed for estimation of electric power losses in electrical networks. Simulation was carried out with a tool developed in MATLAB. Wide sets, deep many-valuedness and sorites arguments http://hdl.handle.net/2099/3631 Wide sets, deep many-valuedness and sorites arguments Pelta Resano, Carlos In this article I show how to obtain a powerful and truthful explanation of the failure of sorites arguments combining an adaptation of the Wide Set Theory formulated by Formato and Gerla and the concept of deep manyvaluedness established by Marraud. It is shown that if the premises of a sorites argument are conceived as a succession of indexed consequence operators (where indices express the accuracy of the inferences) prefixing sentences, the argument fails because the transitive property for the inclusion between wide data sets is not always maintained. 2007-10-03T10:13:01Z Pelta Resano, Carlos In this article I show how to obtain a powerful and truthful explanation of the failure of sorites arguments combining an adaptation of the Wide Set Theory formulated by Formato and Gerla and the concept of deep manyvaluedness established by Marraud. It is shown that if the premises of a sorites argument are conceived as a succession of indexed consequence operators (where indices express the accuracy of the inferences) prefixing sentences, the argument fails because the transitive property for the inclusion between wide data sets is not always maintained.