45 citations · 54 across the 11 of their papers we have counts for
5 papers · 1 filter
Can Graph Neural Networks Learn to Solve MaxSAT Problem?
Minghao Liu, Fuqi Jia, Pei Huang +5
With the rapid development of deep learning techniques, various recent work has tried to apply graph neural networks (GNNs) to solve NP-hard problems such as Boolean Satisfiability…
Counting the Number of Solutions to Constraints
Jian Zhang, Cunjing Ge, Feifei Ma
Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of so…
A New Probabilistic Algorithm for Approximate Model Counting
Cunjing Ge, Feifei Ma, Tian Liu +1
Constrained counting is important in domains ranging from artificial intelligence to software analysis. There are already a few approaches for counting models over various types of…
Diversified Top-k Partial MaxSAT Solving
Junping Zhou, Huanyao Sun, Feifei Ma +3
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem. Given a partial MaxSAT formula F and a positive integer k,…
A Tool for Computing and Estimating the Volume of the Solution Space of SMT(LA)
Cunjing Ge, Feifei Ma, Jian Zhang
There are already quite a few tools for solving the Satisfiability Modulo Theories (SMT) problems. In this paper, we present \texttt{VolCE}, a tool for counting the solutions of SM…