# Soft Computing

Soft Computing > 2017 > 21 > 1 > 245-254

Soft Computing > 2017 > 21 > 1 > 191-197

Soft Computing > 2017 > 21 > 1 > 175-189

Soft Computing > 2017 > 21 > 1 > 39-56

Soft Computing > 2017 > 21 > 1 > 125-147

Soft Computing > 2017 > 21 > 1 > 57-67

Soft Computing > 2017 > 21 > 1 > 79-95

Soft Computing > 2017 > 21 > 1 > 29-37

*continuous formulas*, i.e. formulas of BL whose connectives are among $$ \{ \& ,\vee ,\wedge \}$$ { & , ∨ , ∧ } . The algebraic semantics of this logic is studied together with some of its subclasses corresponding to extensions of the above-mentioned expansion. The axiomatic extensions...

Soft Computing > 2017 > 21 > 1 > 165-174

Soft Computing > 2017 > 21 > 1 > 17-27

*A*can be constructed easily on certain definable subsets of

*A*. Applying these observations to the algebras of Hajek’s basic...

Soft Computing > 2017 > 21 > 1 > 199-212

*k*-means clustering procedure. In the second approach, the candidates for the network’s pattern neurons are selected on the basis of a support vector machines algorithm...

Soft Computing > 2017 > 21 > 1 > 69-77

Soft Computing > 2017 > 21 > 1 > 213-221

Soft Computing > 2017 > 21 > 1 > 223-231

Soft Computing > 2017 > 21 > 1 > 153-163

Soft Computing > 2017 > 21 > 1 > 267-280

Soft Computing > 2017 > 21 > 1 > 11-15