Generalizing Fuzzy Logic Probabilistic Inferences
Linear representations for a subclass of boolean symmetric functions selected by a parity condition are shown to constitute a generalization of the linear constraints on probabilities introduced by Boole. These linear constraints are necessary to compute probabilities of events with relations between the. arbitrarily specified with propositional calculus boolean formulas.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Generalizing the Dempster-Shafer Theory to Fuzzy Sets
With the desire to apply the Dempster-Shafer theory to complex real world problems where the evidential strength is often imprecise and vague, several attempts have been made to generalize the theory. However, the import…
Hinge-Loss Markov Random Fields and Probabilistic Soft Logic
A fundamental challenge in developing high-impact machine learning technologies is balancing the need to model rich, structured domains with the ability to scale to big data. Many important problem areas are both richly …
Knowledge GraphsProbabilistic ProgrammingA conditional, a fuzzy and a probabilistic interpretation of self-organising maps
In this paper we establish a link between fuzzy and preferential semantics for description logics and Self-Organising Maps, which have been proposed as possible candidates to explain the psychological mechanisms underlyi…
A Fundamental Probabilistic Fuzzy Logic Framework Suitable for Causal Reasoning
In this paper, we introduce a fundamental framework to create a bridge between Probability Theory and Fuzzy Logic. Indeed, our theory formulates a random experiment of selecting crisp elements with the criterion of havin…
AttributeCausal InferenceA note on the potentials of probabilistic and fuzzy logic
This paper mainly focuses on (1) a generalized treatment of fuzzy sets of type $n$, where $n$ is an integer larger than or equal to $1$, with an example, mathematical discussions, and real-life interpretation of the give…