1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.SE2016★ 1 cited
Fast Verifying Proofs of Propositional Unsatisfiability via Window Shifting
Jingchao Chen
The robustness and correctness of SAT solvers are receiving more and more attention. In recent SAT competitions, a proof of unsatisfiability emitted by SAT solvers must be checked.…
cs.LO2011
Exploiting Dynamically Propositional Logic Structures in SAT
Jingchao Chen
The 32-bit hwb (hwb-n32 for short) problem is from equivalence checking that arises in combining two circuits computing the hidden weighted bit function. Since 2002, it remains sti…