Pei Huang (黄 沛)
Postdoctoral Scholar, Computer Science
Current Research and Scholarly Interests
Automated Reasoning, Trustworthy AI, Neural Symbolic Methods, Constraint Solving
All Publications
-
NRAgo: Solving SMT(NRA) Formulas with Gradient-based Optimization
IEEE COMPUTER SOC. 2023: 2046-2049
View details for DOI 10.1109/ASE56229.2023.00013
View details for Web of Science ID 001103357200194
-
Improving Bit-Blasting for Nonlinear Integer Constraints
ASSOC COMPUTING MACHINERY. 2023: 14-25
View details for DOI 10.1145/3597926.3598034
View details for Web of Science ID 001122661400002
-
PSMT: Satisfiability Modulo Theories Meets Probability Distribution
IEEE COMPUTER SOC. 2023: 1756-1760
View details for DOI 10.1109/ASE56229.2023.00183
View details for Web of Science ID 001103357200149
- Word Level Robustness Enhancement: Fight Perturbation with Perturbation (AAAI2022) 2022: 10785-10793
- ε-Weakened robustness of deep neural networks (ISSTA2022) 2022: 126-138
- Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5 (SAT2021) 2021: 225-241
- Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks (CP2020) 2020: 885-898
- Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring (IJCAI2019) 2019: 1093-1100
- Approximating Integer Solution Counting via Space Quantification for Linear Constraints (IJCAI2019) 2019: 1697-1703
- Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing (ISSAC2019) 2019: 203-210
- Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing (IJCAR2018) 2018: 354-369