Generalizing Fuzzy Logic Probabilistic Inferences

03/27/2013
by   Silvio Ursic, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 6

page 7

research
11/22/2022

A Complete Diagrammatic Calculus for Boolean Satisfiability

We propose a calculus of string diagrams to reason about satisfiability ...
research
04/01/2022

Sequent calculi of finite dimension

In recent work, the authors introduced the notion of n-dimensional Boole...
research
12/28/2020

Counting the Number of Solutions to Constraints

Compared with constraint satisfaction problems, counting problems have r...
research
05/01/2019

On q-nearly bent Boolean functions

For each non-constant Boolean function q, Klapper introduced the notion ...
research
08/19/2020

Tractable Inference in Credal Sentential Decision Diagrams

Probabilistic sentential decision diagrams are logic circuits where the ...
research
04/10/2018

A Mathematical Framework for Superintelligent Machines

We describe a class calculus that is expressive enough to describe and i...
research
07/21/2022

Correlated Boolean Operators for Uncertainty Logic

We present a correlated and gate which may be used to propagate uncertai...

Please sign up or login with your details

Forgot password? Click here to reset