There have been recent efforts for incorporating Graph Neural Network models for learning full-stack solvers for constraint satisfaction problems (CSP) and particularly Boolean satisfiability (SAT). Despite the unique representational power of these neural embedding models, it is not clear how the search strategy in the learned models actually works. On the other hand, by fixing the search strategy (e.g. greedy search), we would effectively deprive the neural models of learning better strategies than those given. In this paper, we propose a generic neural framework for learning CSP solvers that can be described in terms of probabilistic inference and yet learn search strategies beyond greedy search. Our framework is based on the idea of propagation, decimation and prediction (and hence the name PDP) in graphical models, and can be trained directly toward solving CSP in a fully unsupervised manner via energy minimization, as shown in the paper. Our experimental results demonstrate the effectiveness of our framework for SAT solving compared to both neural and the state-of-the-art baselines.
Efficient Neural Neighborhood Search for Pickup and Delivery Problems
National University of Singapore(新加坡国立大学);Singapore Institute of Manufacturing Technology, A*STAR(新加坡科技研究局制造技术研究所);Institute of Marine Science and Technology, Shandong University(山东大学海洋科学与技术学院);Institute for Infocomm Research, A*STAR(新加坡科技研究局资讯通信研究院);South China University of Technology(华南理工大学)