Sciweavers

38 search results - page 1 / 8
» On probabilistic inference by weighted model counting
Sort
View
JAIR
2011
129views more  JAIR 2011»
14 years 7 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek
104
Voted
JAIR
2007
79views more  JAIR 2007»
15 years 9 days ago
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
97
Voted
AIPS
2006
15 years 1 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
100
Voted
ECSQARU
2007
Springer
15 years 6 months ago
Logical Compilation of Bayesian Networks with Discrete Variables
This paper presents a new approach to inference in Bayesian networks. The principal idea is to encode the network by logical sentences and to compile the resulting encoding into an...
Michael Wachter, Rolf Haenni