AAAI
2006
14 years 1 months ago
2006
The ability to update the structure of a Bayesian network when new data becomes available is crucial for building adaptive systems. Recent work by Sang, Beame, and Kautz (AAAI 200...
AAAI
2006
14 years 1 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
SAT
2005
Springer
14 years 6 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
SEMWEB
2007
Springer
14 years 6 months ago
2007
Springer
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...