نتایج جستجو برای: lukasiewicz composition

تعداد نتایج: 260165  

2009
TOMMASO FLAMINIO

Possibility and necessity measures are commonly defined over Boolean algebras. This work consider a generalization of these kinds of measures over MV-algebras as a possibilistic counterpart of the (probabilistic) notion of state on MV-algebras. Two classes of possibilistic states over MV-algebras of functions are characterized in terms of (generalized) Sugeno integrals. For reasoning about thes...

2007
Francesc Esteva Lluis Godo Carles Noguera

In this paper we study generic expansions of predicate logics of some left-continuous t-norms (mainly Gödel and Nilpotent Minimum predicate logics) with a countable set of truth-constants. Using known results on tnorm based predicate fuzzy logics we obtain results on the conservativeness and completeness for the expansions of some predicate fuzzy logics. We describe the problem for the cases of...

Journal: :Studia Logica 2013
Andrew Bacon

In recent years there has been a revitalised interest in nonclassical solutions to the semantic paradoxes. In this paper I show that a number of logics are susceptible to a strengthened version of Curry’s paradox. This can be adapted to provide a proof theoretic analysis of the ω-inconsistency in Lukasiewicz’s continuum valued logic, allowing us to better evaluate which logics are suitable for ...

2016
David Bevan

The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class, which consist of permutations with a particularly regular structure, we prove that the growth rate of the class exceeds 9.81. This improves on a previous lowe...

2013
Lluis Godo Enrico Marchioni

We introduce the logics E(G) for reasoning about probabilistic expectation over classes G of games with discrete polynomial payoff functions represented by finite-valued Lukasiewicz formulas and provide completeness and complexity results. In addition, we introduce a new class of games where players’ expected payoff functions are encoded by E(G)-formulas. In these games each player’s aim is to ...

Journal: :CoRR 2007
Andrew Schumann Florentin Smarandache

Preamble This book written by A. Schumann & F. Smarandache is devoted to advances of non-Archimedean multiple-validity idea and its applications to logical reasoning. Leibnitz was the first who proposed Archimedes' axiom to be rejected. He postulated infinitesimals (infinitely small numbers) of the unit interval [0, 1] which are larger than zero, but smaller than each positive real number. Robi...

2014
Thomas Lukasiewicz Maria Vanina Martinez Gerardo I. Simari Oana Tifrea-Marciuska

The Web has recently been evolving into a system that is in many ways centered on social interactions and is now more and more becoming what is called the Social Semantic Web. One of the many implications of such an evolution is that the ranking of search results no longer depends solely on the structure of the interconnections among Web pages — instead, the social components must also come int...

Journal: :Soft Comput. 2014
Esko Turunen

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 ...

2016
David Bevan

The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class, which consist of permutations with a particularly regular structure, we prove that the growth rate of the class exceeds 9.81. This improves on a previous lowe...

Journal: :International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 2000
Kai F. Goebel Alice M. Agogino

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید