Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1909.11830
Cited By
Can
Q
Q
Q
-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?
26 September 2019
Vitaly Kurin
Saad Godil
Shimon Whiteson
Bryan Catanzaro
NAI
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Can $Q$-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?"
5 / 5 papers shown
Title
A Reinforcement Learning based Reset Policy for CDCL SAT Solvers
Chunxiao Li
Charlie Liu
Jonathan Chung
Zhengyang Lu
Piyush Jha
Vijay Ganesh
CLL
36
0
0
04 Apr 2024
NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks
Wenxi Wang
Yang Hu
Mohit Tiwari
S. Khurshid
K. McMillan
Risto Miikkulainen
GNN
NAI
27
6
0
26 Oct 2021
The Threat of Offensive AI to Organizations
Yisroel Mirsky
Ambra Demontis
J. Kotak
Ram Shankar
Deng Gelei
Liu Yang
Xinming Zhang
Wenke Lee
Yuval Elovici
Battista Biggio
38
81
0
30 Jun 2021
My Body is a Cage: the Role of Morphology in Graph-Based Incompatible Control
Vitaly Kurin
Maximilian Igl
Tim Rocktaschel
Wendelin Boehmer
Shimon Whiteson
AI4CE
27
88
0
05 Oct 2020
Enhancing SAT solvers with glue variable predictions
Jesse Michael Han
NAI
AAML
14
13
0
06 Jul 2020
1