Fetching the paper…
Reading the bibliography…
We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem.
A. Walker and D. Wood, “Locally balanced binary trees,” The Computer Journal , vol. 19, no. 4, pp. 322–325, 1976
1976
Earlier work this paper cites.
J. Cortadella, “Timing-driven logic bi-decomposition,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , vol. 22, no. 6, pp. 675–685, 2003
2003
Earlier work this paper cites.
P. Bjesse and A. Boralv, “Dag-aware circuit compression for formal verification,” in IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004. IEEE, 2004, pp. 42–49
2004
Earlier work this paper cites.
M. Büttner and J. Rintanen, “Satisfiability planning with constraints on the number of actions.” in International Conference on Automated Planning and Scheduling , 2005, pp. 292–299
2005
Earlier work this paper cites.
N. Sorensson and N. Een, “Minisat v1. 13-a sat solver with conflict-clause minimization,” SAT , vol. 2005, no. 53, pp. 1–2, 2005
2005
Earlier work this paper cites.
A. Mishchenko, S. Chatterjee, and R. Brayton, “Dag-aware aig rewriting: A fresh look at combinational logic synthesis,” in 2006 43rd ACM/IEEE Design Automation Conference . IEEE, 2006, pp. 532–535
2006
Earlier work this paper cites.
C.-A. Wu, T.-H. Lin, C.-C. Lee, and C.-Y. Huang, “Qutesat: a robust circuit-based sat solver for complex circuit structure,” in 2007 Design, Automation & Test in Europe Conference & Exhibition . IEEE, 2007, pp. 1–6
2007
Earlier work this paper cites.
A. Horbach, “A boolean satisfiability approach to the resource-constrained project scheduling problem,” Annals of Operations Research , vol. 181, no. 1, pp. 89–107, 2010
2010
Earlier work this paper cites.
R. Brayton and A. Mishchenko, “Abc: An academic industrial-strength verification tool,” in International Conference on Computer Aided Verification . Springer, 2010, pp. 24–40
2010
Earlier work this paper cites.
A. Belov and Z. Stachniak, “Improved local search for circuit satisfiability,” in International Conference on Theory and Applications of Satisfiability Testing . Springer, 2010, pp. 293–299
2010
Earlier work this paper cites.
Y. Vizel, G. Weissenbacher, and S. Malik, “Boolean satisfiability solvers and their applications in model checking,” Proceedings of the IEEE , vol. 103, no. 11, pp. 2021–2035, 2015
2015
Cited alongside, same era.
A. v. d. Oord, N. Kalchbrenner, O. Vinyals, L. Espeholt, A. Graves, and K. Kavukcuoglu, “Conditional image generation with pixelcnn decoders,” in Proceedings of the 30th International Conference on Neural Information Processing Systems , 2016, pp. 4797–4805
2016
Cited alongside, same era.
T. Toda and T. Soh, “Implementing efficient all solutions sat solvers,” Journal of Experimental Algorithmics (JEA) , vol. 21, pp. 1–44, 2016
2016
Cited alongside, same era.
E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” Advances in neural information processing systems , vol. 30, 2017
2017
Cited alongside, same era.
A. B. K. F. M. Fleury and M. Heisinger, “Cadical, kissat, paracooba, plingeling and treengeling entering the sat competition 2020,” SAT COMPETITION , vol. 2020, p. 50, 2020
2020
Later among the works it cites.
V. Kurin, S. Godil, S. Whiteson, and B. Catanzaro, “Can q-learning with graph networks learn a generalizable branching heuristic for a sat solver?” Advances in Neural Information Processing Systems , vol. 33, pp. 9608–9621, 2020
2020
Later among the works it cites.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE transactions on neural networks and learning systems , vol. 32, no. 1, pp. 4–24, 2020
2020
Later among the works it cites.
W. Zhang, Z. Sun, Q. Zhu, G. Li, S. Cai, Y. Xiong, and L. Zhang, “Nlocalsat: boosting local search with solution prediction,” in Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence , 2021, pp. 1177–1183
2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Snell, K. Swersky, and R. Zemel, “Prototypical networks for few-shot learning,” in Proceedings of the 31st International Conference on Neural Information Processing Systems , 2017, pp. 4080–4090
2017
Cited alongside, same era.
E. Yolcu and B. Póczos, “Learning local search heuristics for boolean satisfiability,” Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Cited alongside, same era.
D. Selsam, M. Lamm, B. Bünz, P. Liang, L. de Moura, and D. L. Dill, “Learning a SAT solver from single-bit supervision,” in International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
S. Amizadeh, S. Matusevych, and M. Weimer, “Learning to solve circuit-SAT: An unsupervised differentiable approach,” in International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
M. Fey and J. E. Lenssen, “Fast graph representation learning with PyTorch Geometric,” in ICLR Workshop on Representation Learning on Graphs and Manifolds , 2019
2019
Cited alongside, same era.
Later among the works it cites.
V. Thost and J. Chen, “Directed acyclic graph neural networks,” in International Conference on Learning Representations , 2021
2021
Later among the works it cites.
H.-T. Zhang, J.-H. R. Jiang, and A. Mishchenko, “A circuit-based sat solver for logic synthesis,” in 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD) . IEEE, 2021, pp. 1–6
2021
Later among the works it cites.
H. Duan, P. Vaezipoor, M. B. Paulus, Y. Ruan, and C. Maddison, “Augment with care: Contrastive learning for combinatorial problems,” in International Conference on Machine Learning . PMLR, 2022, pp. 5627–5642
2022
Closest in time.
B. Hudson, Q. Li, M. Malencia, and A. Prorok, “Graph neural network guided local search for the traveling salesperson problem,” in International Conference on Learning Representations , 2022
2022
Closest in time.
M. Li, S. Khan, Z. Shi, N. Wang, Y. Huang, and Q. Xu, “Deepgate: learning neural representations of logic gates,” in Proceedings of the 59th ACM/IEEE Design Automation Conference , 2022, pp. 667–672
2022
Closest in time.