1 citations · 1 across the 1 of their papers we have counts for
3 papers
On the Approximability of Weighted Model Integration on DNF Structures
Ralph Abboud, İsmail İlkan Ceylan, Radoslav Dimitrov
Weighted model counting (WMC) consists of computing the weighted sum of all satisfying assignments of a propositional formula. WMC is well-known to be #P-hard for exact solving, bu…
CounterExample Guided Neural Synthesis
Elizabeth Polgreen, Ralph Abboud, Daniel Kroening
Program synthesis is the generation of a program from a specification. Correct synthesis is difficult, and methods that provide formal guarantees suffer from scalability issues. On…
Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting
Ralph Abboud, Ismail Ilkan Ceylan, Thomas Lukasiewicz
Weighted model counting (WMC) has emerged as a prevalent approach for probabilistic inference. In its most general form, WMC is #P-hard. Weighted DNF counting (weighted #DNF) is a…