Allen Van Gelder. Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution . In International Symposium on Artificial Intelligence and Mathematics (AI&M 2002), Fort Lauderdale, Florida, USA, January 2-4, 2002. 2002. [doi]
Abstract is missing.