DeepAI AI Chat
Log In Sign Up

Incremental Probabilistic Inference

03/06/2013
by   Bruce D'Ambrosio, et al.
0

Propositional representation services such as truth maintenance systems offer powerful support for incremental, interleaved, problem-model construction and evaluation. Probabilistic inference systems, in contrast, have lagged behind in supporting this incrementality typically demanded by problem solvers. The problem, we argue, is that the basic task of probabilistic inference is typically formulated at too large a grain-size. We show how a system built around a smaller grain-size inference task can have the desired incrementality and serve as the basis for a low-level (propositional) probabilistic representation service.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8

05/10/2013

Programming with Personalized PageRank: A Locally Groundable First-Order Probabilistic Logic

In many probabilistic first-order representation systems, inference is p...
06/04/2013

First-Order Decomposition Trees

Lifting attempts to speed up probabilistic inference by exploiting symme...
03/18/2018

Cubical Assemblies and the Independence of the Propositional Resizing Axiom

We construct a model of cubical type theory with a univalent and impredi...
03/18/2018

Cubical Assemblies and Independence of the Propositional Resizing Axiom

We construct a model of cubical type theory with a univalent and impredi...
03/27/2013

Process, Structure, and Modularity in Reasoning with Uncertainty

Computational mechanisms for uncertainty management must support interac...
10/16/2012

Lifted Relax, Compensate and then Recover: From Approximate to Exact Lifted Probabilistic Inference

We propose an approach to lifted approximate inference for first-order p...
03/09/2000

On the tractable counting of theory models and its application to belief revision and truth maintenance

We introduced decomposable negation normal form (DNNF) recently as a tra...