Compressed Constraints in Probabilistic Logic and Their Revision

by   Paul Snow, et al.

In probabilistic logic entailments, even moderate size problems can yield linear constraint systems with so many variables that exact methods are impractical. This difficulty can be remedied in many cases of interest by introducing a three valued logic (true, false, and "don't care"). The three-valued approach allows the construction of "compressed" constraint systems which have the same solution sets as their two-valued counterparts, but which may involve dramatically fewer variables. Techniques to calculate point estimates for the posterior probabilities of entailed sentences are discussed.



page 1

page 2

page 4

page 5

page 6


Entropy and Syntropy in the Context of Five-Valued Logics

This paper presents a five-valued representation of bifuzzy sets. This r...

Many-valued logics inside λ-calculus: Church's rescue of Russell with Bohm trees

We extend the Church encoding of the Booleans and two-valued Boolean Log...

Beliefs and Probability in Bacchus' l.p. Logic: A 3-Valued Logic Solution to Apparent Counter-intuition

Fundamental discrepancy between first order logic and statistical infere...

On Coalgebraic Many-Valued Modal Logic

In this paper, we investigate the many-valued version of coalgebraic mod...

n-Valued Refined Neutrosophic Logic and Its Applications to Physics

In this paper we present a short history of logics: from particular case...

MSO+nabla is undecidable

This paper is about an extension of monadic second-order logic over infi...

Constraint-Based Visual Generation

In the last few years the systematic adoption of deep learning to visual...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.