1 paper
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…