Horsch Michael and Havens Bill. Probabilistic arc consistency: A connection between constraint reasoning and probabilistic reasoning. In UAI-2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Empirical Study of Probabilistic Arc Consistency as a.. - Horsch, Havens Self-citation (Horsch Havens) (Correct)
....assignment appears most often in all solutions Solution probabilities can therefore provide an ordering to unassigned variables, as well as an ordering for the values for each variable. We have developed a method for approximating solution probabilities for binary CSPs. We have shown elsewhere [6] that our method is a generalization of the arc consistency algorithm AC 3 [7] for general constraint graphs. We have also shown (op. cit. that it is a specialization of probabilistic reasoning in Bayesian networks [9] For this reason, we call our method probabilistic arc consistency (pAC) Our ....
Michael C. Horsch and William S. Havens. Probabilistic Arc Consistency: A connection between constraint reasoning and probabilistic reasoning. In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, 2000. To appear.
Counting-Based Look-Ahead Schemes for Constraint Satisfaction - Kask, Dechter, Gogate (2004) (Correct)
No context found.
Horsch Michael and Havens Bill. Probabilistic arc consistency: A connection between constraint reasoning and probabilistic reasoning. In UAI-2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC