All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 6 of 6

Showing per page

On (anti) conditional independence in Dempster-Shafer theory.

Mieczyslaw A. Klopotek (1998)

Mathware and Soft Computing

This paper verifies a result of [9] concerning graphoidal structure of Shenoy's notion of independence for Dempster-Shafer theory belief functions. Shenoy proved that his notion of independence has graphoidal properties for positive normal valuations. The requirement of strict positive normal valuations as prerequisite for application of graphoidal properties excludes a wide class of DS belief functions. It excludes especially so-called probabilistic belief functions. It is demonstrated that the...

On some properties of grounding nonuniform sets of modal conjunctions

Radoslaw Katarzyniak (2006)

International Journal of Applied Mathematics and Computer Science

A language grounding problem is considered for nonuniform sets of modal conjunctions consisting of conjunctions extended with more than one modal operator of knowledge, belief or possibility. The grounding is considered in the context of semiotic triangles built from language symbols, communicative cognitive agents and external objects. The communicative cognitive agents are assumed to be able to observe external worlds and store the results of observations in internal knowledge bases. It is assumed...

On some properties of α -planes of type-2 fuzzy sets

Zdenko Takáč (2013)

Kybernetika

Some basic properties of α -planes of type-2 fuzzy sets are investigated and discussed in connection with the similar properties of α -cuts of type-1 fuzzy sets. It is known, that standard intersection and standard union of type-1 fuzzy sets (it means intersection and union under minimum t-norm and maximum t-conorm, respectively) are the only cutworthy operations for type-1 fuzzy sets. Recently, a similar property was declared to be true also for α -planes of type-2 fuzzy sets in a few papers. Thus,...

Operating on formal concept abstraction.

Anio O. Arigoni, Andrea Rossi (1994)

Mathware and Soft Computing

The subject of this paper regards a procedure to obtain the abstract form of concepts, directly from their most natural form, thus these can be efficiently learned and the possibility of operating formally on them is reached. The achievement of said type of form results also useful to compute conceptual parameters symbolic and numerical in nature.

Currently displaying 1 – 6 of 6

Page 1