This paper proposes organization and selection methods of composite behaviors for artificial creatures. Using the degree of consideration-based mechanism of thought (DoC-MoT), each pre-defined atom behavior is evaluated by the fuzzy integral of the partial evaluation values of atom behaviors over the artificial creature’s wills and external contexts, with respect to the fuzzy measure values rep...

Dielectric surfaces exposed to partial discharges (PD) undergo aging, which is reflected by changes in the discharge pulse form. An approach is described in which fuzzy logic and neural networks are used in conjunction with the wavelet transform to identify the parameters in the PD pulse form for the purpose of classifying the aging phenomena due to partial discharge degradation.

Complete pre-orders can be characterized in terms of the transitivity of the corresponding strict preference and indifference relations. In this paper, we investigate this characterization in a fuzzy setting. We consider two types of completeness (weak completeness and strong completeness) and decompose a fuzzy pre-order by means of an indifference generator, in particular a Frank t-norm. In th...

Fuzzy relational databases have been introduced to deal with uncertain or incomplete information demonstrating the efficiency of processing fuzzy queries. For these reasons, many organizations aim to integrate flexible querying to handle imprecise data or to use fuzzy data mining tools, minimizing the transformation costs. The best solution is to offer a smooth migration towards this technology...

The purpose of this paper is to present some coincidence point and common  fixed point theorems for multivalued contraction maps in complete fuzzy  metric spaces endowed with a partial order. As an application, we give  an existence theorem of solution for general classes of integral  inclusions by the coincidence point theorem.

R. Klein Levinski College Tel A vi v, Israel An m-<1egel1er'a J. Schonheim School of Mathematical Sciences Sackler Faculty of Exact Sciences Tel Aviv Israel every subgraph of which has minimal at most m. An (mI, m2, ... , the set of which can be partitioned into s sets generating rpc,,,prtlvplv We conjecture that such a graph is )J colorable. Partial results is settled. ~VU"Uv',"". but not e...