Intuitionistic Fuzzy Sets (IFS) are defined as pairs of mutually orthogonal fuzzy sets. We discuss this approach from an algebraic point of view. As a result we characterize two implication operators on the collection of IFS, which on a particular subset of IFS behave as a Lukasiewicz and a Gödel implication.

We investigate the computational complexity of admissibility of inference rules in infinite-valued Lukasiewicz propositional logic ( L). It was shown in [13] that admissibility in L is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of L are PSPACE-complete. In contrast, derivable rules of L are known to be coNP-complete.

Hopscotch” is a world-wide game for children to play since the times in the ancient Roman Empire and China. Here we present a study mainly focused on the research and discussion of the application on the children’s well-know edutainment via the physical interactive design to provide the sensing of the times for the conventional hopscotch, which is a new type of experiment for the technology aid...

In this paper we shall describe a correspondence between Rational à Lukasiewicz formulas and neural networks in which the activation function is the truncated identity and synaptic weights are rational numbers. On one hand to have a logical representation (in a given logic) of neural networks could widen the interpretability, amalgamability and reuse of these objects. On the other hand, neural ...

Although it is well-known that every satisfiable formula in Lukasiewicz’ infinite-valued logic L∞ can be satisfied in some finitevalued logic, practical methods for finding an appropriate number of truth degrees do currently not exist. As a first step towards efficient reasoning in L∞, we propose a method to find a tight upper bound on this number which, in practice, often significantly improve...

Received 22 November 2004 This work was partially supported by the Universidad Nacional del Sur, Bah́ıa Blanca, Argentina.

Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, counting) weighted Max 2-Sat instances. One of them has a good performance if the underlying constraint graph has a small separator decomposition, another has a slightly improved worst case performance. For a 2-Sat inst...

The aim of this study was to critically examine the influence of body size on maximal oxygen uptake (VO2 max) in boys and men using body mass (BM), estimated fat-free mass (FFM), and estimated lower leg muscle volume (Vol) as the separate scaling variables. VO2 max and an in vivo measurement of Vol were assessed in 15 boys and 14 men. The FFM was estimated after percentage body fat had been pre...