Name
Abstract | ||
|---|---|---|
Graph Neural Network (GNN) has shown great power on many practical tasks in the past few years. It is also considered to be a potential technique in bridging the gap between machine learning and symbolic reasoning. Experimental investigations have also shown that some \\(\\mathcal {NP}\\)-Hard constraint satisfaction problems can be well learned by the GNN models. In this paper, a GNN-based classification model to learn the satisfiability of pseudo-Boolean (PB) problem is proposed. After constructing the bipartite graph representation, a two-phase message passing process is executed. Experiments on 0–1 knapsack and weighted independent set problems show that the model can effectively learn the features related to the problem distribution and satisfiability. As a result, competitive prediction accuracy has been achieved with some generalization to larger-scale problems. The studies indicate that GNN has great potential in solving constraint satisfaction problems with numerical coefficients. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-58475-7_51 | CP |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minghao Liu | 1 | 0 | 1.69 |
| Fan Zhang | 2 | 38 | 4.95 |
| Pei Huang | 3 | 0 | 2.03 |
| Shuzi Niu | 4 | 0 | 0.34 |
| Feifei Ma | 5 | 58 | 13.64 |
| Jian Zhang | 6 | 32 | 12.20 |