Learning rate based branching heuristic for SAT solvers
DOI10.1007/978-3-319-40970-2_9zbMATH Open1475.68348OpenAlexW2498324117MaRDI QIDQ2818006FDOQ2818006
Authors: Jia Hui Liang, Vijay Ganesh, Pascal Poupart, Krzysztof Czarnecki 
Publication date: 5 September 2016
Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40970-2_9
Recommendations
- An empirical study of branching heuristics through the lens of global learning rate
- Learning to select branching rules in the DPLL procedure for satisfiability
- Branching rules for satisfiability
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
- Machine learning-based restart policy for CDCL SAT solvers
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Theory and Applications of Satisfiability Testing
- Hardware and Software, Verification and Testing
- BerkMin: A fast and robust SAT-solver
- The community structure of SAT formulas
- Impact of Community Structure on SAT Solver Performance
- Bounded model checking using satisfiability solving
- Solving propositional satisfiability problems
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Evaluating CDCL variable scoring schemes
- Learning to select branching rules in the DPLL procedure for satisfiability
- Learning rate based branching heuristic for SAT solvers
- The Solution of a Certain Two-Person Zero-Sum Game
Cited In (23)
- Learning to select branching rules in the DPLL procedure for satisfiability
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
- Deep cooperation of CDCL and local search for SAT
- On dedicated CDCL strategies for PB solvers
- On the hierarchical community structure of practical Boolean formulas
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs
- Popularity-similarity random SAT formulas
- Preprocessing of propagation redundant clauses
- Preprocessing of propagation redundant clauses
- Machine learning and logic: a new frontier in artificial intelligence
- Improving SAT Solving Using Monte Carlo Tree Search-Based Clause Learning
- Assessing progress in SAT solvers through the Lens of incremental SAT
- Incorporating Learning in Grid-Based Randomized SAT Solving
- A nonexistence certificate for projective planes of order ten with weight 15 codewords
- An empirical study of branching heuristics through the lens of global learning rate
- Towards better heuristics for solving bounded model checking problems
- Title not available (Why is that?)
- Clause vivification by unit propagation in CDCL SAT solvers
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
- Learning rate based branching heuristic for SAT solvers
- SAT competition 2020
- Learning in a compiler for MINSAT algorithms
Uses Software
This page was built for publication: Learning rate based branching heuristic for SAT solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2818006)
