Peterson’s Intermediate Syllogisms, generalizing Aristotelian syllogisms by intermediate quantifiers ‘Many’, ‘Most’ and ‘Almost all’, are studied. It is demonstrated that, by associating certain values V, W and U on standard Lukasiewicz MV–algebra with the first and second premise and the conclusion, respectively, the validity of a corresponding intermediate syllogism is determined by a simple ...

This paper introduces fuzzy belief nets (FBN). The ability to invert arcs between nodes is key to solving belief nets. The inversion is accomplished by defining closeness measures which allow diagnostic reasoning from observed symptoms to cause of failures. The closeness measures are motivated by a Lukasiewicz operator which takes into account the distance from an observed symptom set to the mo...

The framework of multi-adjoint logic programming has shown to cover a number of approaches to reason under uncertainty, imprecise data or incomplete information. In previous works, we have presented a neural implementation of its fix-point semantics for a signature in which conjunctors are built as an ordinal sum of a finite family of basic conjunctors (Gödel and Lukasiewicz t-norms). Taking in...

This paper is on the combination of two powerful approaches to uncertain reasoning: logic programming in a probabilistic setting, on the one hand, and the information-theoretical principle of maximum entropy, on the other hand. More precisely, we present two approaches to probabilistic logic programming under maximum entropy. The first one is based on the usual notion of entailment under maximu...

The present communication suggests deductive systems for the operator a of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of these logics in the sense of Lukasiewicz: for every formula φ either ` φ or a φ (but not both) is derivable. In particular, purely syntactic decision procedure is provided for the logics under considera...

In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.

Ward and Dilworth 1 introduced the concept of residuated lattices as generalization of ideal lattices of rings. The residuated lattice plays the role of semantics for a multiple-valued logic called residuated logic. Residuated logic is a generalization of intuitionistic logic. Therefore it is weaker than classical logic. Important examples of residuated lattices related to logic are Boolean alg...

J. Vaz De Carvalho and T. Almada in A generalization of the Lukasiewicz algebras, Studia Logica 69 (2001), 329-338 introduced the variety Ln , m ≥ 1, n ≥ 2, of m–generalized Lukasiewicz algebras of order n as a generalization of Lukasiewicz algebras of order n and a particular case of Ockham algebras. In this note, bearing in mind the important role that weak implication played in the study of ...

in this paper, based in the l ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.

We define the Lukasiewicz transform as a residuated map and a homomorphism between semimodules over the semiring reducts of an MV-algebra. Then we describe the “ Lukasiewicz Transform Based” ( LTB) algorithm for image processing, demonstrating its applicability.