In this paper, we present a Complex-valued Neuro-Fuzzy Inference System (CNFIS) and develop its meta-cognitive learning algorithm. CNFIS has four layersan input layer with m rules, a Gaussian layer with K rules, a normalization layer with K rules and an output layer with n rules. The rules in the Gaussian layer map the m-dimensional complex-valued input features to a K-dimensional real-valued s...

In this paper, we introduce a new sort of interval valued $left(in ,in vee q_{widetilde{k}}^{widetilde{delta }}right) $-fuzzy bi-ideal in ordered semigroups which is the generalization of interval valued $left( in ,in vee q_{%widetilde{k}}right) $-fuzzy bi-ideal and interval valued $left( in ,in vee qright) $-fuzzy bi-ideal of ordered semigroups. We give examples in which we show that these str...

| In this paper, we use a genetic algorithm to evolve a set of classiication rules with real-valued attributes. We show how real-valued attribute ranges can be encoded with real-valued genes and present a new uniform method for representing don't cares in the rules. We view supervised classiication as an optimization problem, and evolve rule sets that maximize the number of correct classiicatio...

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

We explore some links between abstract argumentation, logic and kernels in digraphs. Viewing argumentation frameworks as propositional theories in graph normal form, we observe that the stable semantics for argumentation can be given equivalently in terms of satisfaction and logical consequence in classical logic. We go on to show that the complete semantics can be formulated using Lukasiewicz ...

In this paper, we extend Nilsson’s probabilistic logic [1] to allow that each sentence S has three sets of possible worlds. We adopt the ideas of consistency and possible worlds introduced by Nilsson in [1], but propose a new method called linear equation method to deal with the problems of probabilistic inference, the results of our method is consistent with those of Yao’s interval-set model m...

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...