3 citations · 6 across the 4 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.AI2023
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…
cs.DS2023
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…
cs.LO2023★ 2 cited
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…