Probabilistic arc consistency: a connection between constraint reasoning and probabilistic reasoning

Authors:
Michael C. Horsch;William S. Havens
Affiliations:
Intelligent Systems Laboratory, School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;Intelligent Systems Laboratory, School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada
Venue:
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Year:
2000

Citing 11
Cited 1

Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Algorithms for constraint-satisfaction problems: a survey

AI Magazine
A revolution: belief propagation in graphs with cycles

NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
New methods to color the vertices of a graph

Communications of the ACM
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
An Examination of Probabilistic Value-Ordering Heuristics

AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Exploiting causal independence in Bayesian network inference

Journal of Artificial Intelligence Research
A computational model for causal and diagnostic reasoning in inference systems

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Bayes networks for estimating the number of solutions to a CSP

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Loopy belief propagation for approximate inference: an empirical study

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Rational deployment of CSP heuristics

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Quantified Score

Hi-index	0.00

Visualization

Abstract

We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called 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 singlyconnected constraint problems, but can work well as an approximation for arbitrary problems. We briefly discuss some empirical results, and related methods.