Minghao Liu

Orcid: 0000-0002-9673-6463

Affiliations:
  • Chinese Academy of Sciences, Institute of Software, Beijing, China


According to our database1, Minghao Liu authored at least 16 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Investigating the Existence of Holey Latin Squares via Satisfiability Testing.
Proceedings of the PRICAI 2023: Trends in Artificial Intelligence, 2023

Suggesting Variable Order for Cylindrical Algebraic Decomposition via Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

NRAgo: Solving SMT(NRA) Formulas with Gradient-Based Optimization.
Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering, 2023

PSMT: Satisfiability Modulo Theories Meets Probability Distribution.
Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering, 2023

Improving Bit-Blasting for Nonlinear Integer Constraints.
Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis, 2023

Can Graph Neural Networks Learn to Solve the MaxSAT Problem? (Student Abstract).
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Modelling and solving the supply marketing order allocation problem with time consistency and bundle discounts.
J. Oper. Res. Soc., 2022

Improving Simulated Annealing for Clique Partitioning Problems.
J. Artif. Intell. Res., 2022

ε-weakened robustness of deep neural networks.
Proceedings of the ISSTA '22: 31st ACM SIGSOFT International Symposium on Software Testing and Analysis, Virtual Event, South Korea, July 18, 2022

Word Level Robustness Enhancement: Fight Perturbation with Perturbation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Can Graph Neural Networks Learn to Solve MaxSAT Problem?
CoRR, 2021

Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020
Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
A Community-Division Based Algorithm for Finding Relations Among Linear Constraints.
Proceedings of the Knowledge Science, Engineering and Management, 2018


  Loading...