10 citations · 20 across the 11 of their papers we have counts for
11 papers
Numerical Considerations in Weighted Model Counting
Randal E. Bryant
Weighted model counting computes the sum of the rational-valued weights associated with the satisfying assignments for a Boolean formula, where the weight of an assignment is given…
Notes on "Bounds on BDD-Based Bucket Elimination''
Randal E. Bryant
This paper concerns Boolean satisfiability (SAT) solvers based on Ordered Binary Decision Diagrams (BDDs), especially those that can generate proofs of unsatisfiability. Mengel (ar…
Proof Generation for CDCL Solvers Using Gauss-Jordan Elimination
Mate Soos, Randal E. Bryant
Traditional Boolean satisfiability (SAT) solvers based on the conflict-driven clause-learning (CDCL) framework fare poorly on formulas involving large numbers of parity constraints…
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
Randal E. Bryant, Marijn J. H. Heule
In 2006, Biere, Jussila, and Sinz made the key observation that the underlying logic behind algorithms for constructing Reduced, Ordered Binary Decision Diagrams (BDDs) can be enco…
From Data to Knowledge to Action: Enabling the Smart Grid
Randal E. Bryant, Randy H. Katz, Chase Hensel +1
Our nation's infrastructure for generating, transmitting, and distributing electricity - "The Grid" - is a relic based in many respects on century-old technology. It consists of ex…
Chain Reduction for Binary and Zero-Suppressed Decision Diagrams
Randal E. Bryant
Chain reduction enables reduced ordered binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) to each take advantage of the others' ability to symboli…