Among the execution of modern Boolean Satisfiability (SAT) and Mixed Integer Programming (MIP) solvers, presolving is a commonly employed procedure between the encoding and solving phases with multiple preprocessing techniques to simplify the in- stance size or improve its “strength”. However, this powerful tool has not yet been widely used in Pseudo-Boolean Solving/Optimization closely related to SAT and MIP. In this report, we study categories of SAT/MIP preprocessing techniques and try to adapt or lift them into Pseudo-Boolean configuration. The experiments show that a considerable number of instances could be solved faster after being processed by the presolving when using a Pseudo-Boolean solver, while this still fails to help solve more instances within a certain time limit.