Bayes networks for estimating the number of solutions to a CSP

Authors:
Amnon Meisels;Solomon Eyal Shimony;Gadi Solotorevsky
Affiliations:
Mathematics and Computer Science Department,, Ben-Gurion University, Be'er Sheva, Israel;Mathematics and Computer Science Department,, Ben-Gurion University, Be'er Sheva, Israel;Mathematics and Computer Science Department,, Ben-Gurion University, Be'er Sheva, Israel
Venue:
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Year:
1997

Citing 7
Cited 5

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
The computational complexity of probabilistic inference using Bayesian belief networks (research note)

Artificial Intelligence
Approximating probabilistic inference in Bayesian belief networks is NP-hard

Artificial Intelligence
Approximating Probabilistic Inference in Bayesian Belief Networks

IEEE Transactions on Pattern Analysis and Machine Intelligence
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Sample-and-accumulate algorithms for belief updating in Bayes networks

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Models and thresholds for random constraint satisfaction problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Random Constraint Satisfaction: Flaws and Structure

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
Probabilistic arc consistency: a connection between constraint reasoning and probabilistic reasoning

UAI'00 Proceedings of the Sixteenth 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

The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the probabilities in Bayes networks is a problem which has been studied for a while, and may well provide a good approximation to counting the number of solutions. We use a simple approximation based on independence, and show that it is correct for tree-structured CSPs. For other CSPs, it is a less optimistic approximation than those suggested in prior work, and experiments show that it is more accurate on the average. We present empirical evidence that our approximation is a useful search heuristic for finding a single solution to a CSP.