Skip to content
conftrace_

branching heuristic

9 papers

Explore in graph

Co-occurring keywords · papers mentioning both

sat solver (4) combinatorial optimization (4) graph neural network (2) model counting (2) conflict-driven clause learning (2) branch and bound (2) reinforcement learning (2) conflict depression (1) propositional model counting (1) random exploration (1)

Papers

A Top-Down Tree Model Counter for Quantified Boolean Formulas IJCAI 2024 Reinforcement Learning for Branch-and-Bound Optimisation Using Retrospective Trajectories AAAI 2023 Suggesting Variable Order for Cylindrical Algebraic Decomposition via Reinforcement Learning NeurIPS 2023 Deep Cooperation of CDCL and Local Search for SAT (Extended Abstract) IJCAI 2022 Learning Branching Heuristics for Propositional Model Counting AAAI 2021 A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems AAAI 2020 Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver? NeurIPS 2020 Guiding CDCL SAT Search via Random Exploration amid Conflict Depression AAAI 2020 An Empirical Study of Branching Heuristics through the Lens of Global Learning Rate IJCAI 2018