167 citations · 522 across the 16 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.AI2012★ 99 cited
CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
Vitor Santos Costa, David Page, Maleeha Qazi +1
We present CLP(BN), a novel approach that aims at expressing Bayesian networks through the constraint logic programming framework. Arguably, an important limitation of traditional…
cs.AI2012★ 43 cited
Bayesian network learning by compiling to weighted MAX-SAT
James Cussens
The problem of learning discrete Bayesian networks from data is encoded as a weighted MAX-SAT problem and the MaxWalkSat local search algorithm is used to address it. For each data…
cs.AI2012★ 167 cited
Bayesian network learning with cutting planes
James Cussens
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisation…