Stanford Advisors

Contact

  • Academic
    huangpei@stanford.edu
    University - Scholar Department: Computer Science Position: Postdoctoral Scholar

Additional Info

  • Mail Code: 9025

Current Research and Scholarly Interests

Automated Reasoning, Trustworthy AI, Neural Symbolic Methods, Constraint Solving

All Publications

  • Word Level Robustness Enhancement: Fight Perturbation with Perturbation (AAAI2022) Huang, P., Yang, Y., Jia, F., Liu, M., Ma, F., Zhang, J. 2022: 10785-10793
  • ε-Weakened robustness of deep neural networks (ISSTA2022) Huang, P., Yang, Y., Liu, M., Jia, F., Ma, F., Zhang, J. 2022: 126-138
  • Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5 (SAT2021) Huang, P., Li, R., Liu, M., Ma, F., Zhang, J. 2021: 225-241
  • Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks (CP2020) Liu, M., Zhang, F., Huang, P., Niu, S., Ma, F., Zhang, J. 2020: 885-898
  • Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring (IJCAI2019) Huang, P., Liu, M., Wang, P., Zhang, W., Ma, F., Zhang, J. 2019: 1093-1100
  • Approximating Integer Solution Counting via Space Quantification for Linear Constraints (IJCAI2019) Ge, C., Ma, F., Ma, X., Zhang, F., Huang, P., Zhang, J. 2019: 1697-1703
  • Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing (ISSAC2019) Huang, P., Liu, M., Ge, C., Ma, F., Zhang, J. 2019: 203-210
  • Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing (IJCAR2018) Huang, P., Ma, F., Ge, C., Zhang, J., Zhang, H. 2018: 354-369