225 citations · 617 across the 17 of their papers we have counts for
17 papers
Learning Branching Heuristics for Propositional Model Counting
Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu +4
Propositional model counting, or #SAT, is the problem of computing the number of satisfying assignments of a Boolean formula. Many problems from different application areas, includ…
Exploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the Stable Matching Problem with Couples
Andrew Perrault, Joanna Drummond, Fahiem Bacchus
The Stable Matching Problem with Couples (SMP-C) is a ubiquitous real-world extension of the stable matching problem (SMP) involving complementarities. Although SMP can be solved i…
Solving #SAT and Bayesian Inference with Backtracking Search
Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
Inference in Bayes Nets (BAYES) is an important problem with numerous applications in probabilistic reasoning. Counting the number of satisfying assignments of a propositional form…
Probability Distributions Over Possible Worlds
Fahiem Bacchus
In Probabilistic Logic Nilsson uses the device of a probability distribution over a set of possible worlds to assign probabilities to the sentences of a logical language. In his pa…
Lp : A Logic for Statistical Information
Fahiem Bacchus
This extended abstract presents a logic, called Lp, that is capable of representing and reasoning with a wide variety of both qualitative and quantitative statistical information.…
Using Causal Information and Local Measures to Learn Bayesian Networks
Wai Lam, Fahiem Bacchus
In previous work we developed a method of learning Bayesian Network models from raw data. This method relies on the well known minimal description length (MDL) principle. The MDL p…