3 citations · 6 across the 4 of their papers we have counts for
6 papers
Engineering an Efficient Approximate DNF-Counter
Mate Soos, Uddalok Sarkar, Divesh Aggarwal +3
Model counting is a fundamental problem in many practical applications, including query evaluation in probabilistic databases and failure-probability estimation of networks. In thi…
Explaining SAT Solving Using Causal Reasoning
Jiong Yang, Arijit Shaw, Teodora Baluta +2
The past three decades have witnessed notable success in designing efficient SAT solvers, with modern solvers capable of solving industrial benchmarks containing millions of variab…
Algorithms Transcending the SAT-Symmetry Interface
Markus Anders, Pascal Schweitzer, Mate Soos
Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symme…
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…
Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling
Mate Soos, Kuldeep S. Meel
Given a Boolean formula over the set of variables and a projection set , a subset of variables is independent support of $\mathcal{P}…
BOSPHORUS: Bridging ANF and CNF Solvers
Davin Choo, Mate Soos, Kian Ming A. Chai +1
Algebraic Normal Form (ANF) and Conjunctive Normal Form (CNF) are commonly used to encode problems in Boolean algebra. ANFs are typically solved via Gr"obner basis algorithms, ofte…