62 citations · 238 across the 21 of their papers we have counts for
1 paper · 1 filter
Wenxi Wang, Yang Hu, Mohit Tiwari +3
Propositional satisfiability (SAT) is an NP-complete problem that impacts many research fields, such as planning, verification, and security. Mainstream modern SAT solvers are base…