Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning

01/16/2013
by   Michael C. Horsch, et al.
0

We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called em probabilistic arc consistency, which is both a generalization of a well known algorithm for arc consistency used in constraint reasoning, and a specialization of the belief updating algorithm for singly-connected networks. Our algorithm is exact for singly- connected constraint problems, but can work well as an approximation for arbitrary problems. We briefly discuss some empirical results, and related methods.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 9

10/19/2012

Probabilistic Reasoning about Actions in Nonmonotonic Causal Theories

We present the language m Pcal C+ for probabilistic reasoning about acti...
03/27/2013

A Constraint Propagation Approach to Probabilistic Reasoning

The paper demonstrates that strict adherence to probability theory does ...
03/24/2020

Hybrid Classification and Reasoning for Image-based Constraint Solving

There is an increased interest in solving complex constrained problems w...
11/16/2019

Taming Reasoning in Temporal Probabilistic Relational Models

Evidence often grounds temporal probabilistic relational models over tim...
03/27/2013

Directed Cycles in Belief Networks

The most difficult task in probabilistic reasoning may be handling direc...
02/27/2013

On the Relation between Kappa Calculus and Probabilistic Reasoning

We study the connection between kappa calculus and probabilistic reasoni...
03/27/2013

Coefficients of Relations for Probabilistic Reasoning

Definitions and notations with historical references are given for some ...
This week in AI

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