Learning Rate Based Branching Heuristic for SAT Solvers
From MaRDI portal
Publication:2818006
DOI10.1007/978-3-319-40970-2_9zbMath1475.68348OpenAlexW2498324117MaRDI QIDQ2818006
Pascal Poupart, Vijay Ganesh, Jia Hui Liang, 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
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs ⋮ Machine learning and logic: a new frontier in artificial intelligence ⋮ Towards better heuristics for solving bounded model checking problems ⋮ Improving SAT Solving Using Monte Carlo Tree Search-Based Clause Learning ⋮ Popularity-similarity random SAT formulas ⋮ Preprocessing of propagation redundant clauses ⋮ Clause vivification by unit propagation in CDCL SAT solvers ⋮ Unnamed Item ⋮ Learning Rate Based Branching Heuristic for SAT Solvers ⋮ SAT competition 2020 ⋮ MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords ⋮ Preprocessing of propagation redundant clauses ⋮ Deep cooperation of CDCL and local search for SAT ⋮ Assessing progress in SAT solvers through the Lens of incremental SAT ⋮ On dedicated CDCL strategies for PB solvers ⋮ On the hierarchical community structure of practical Boolean formulas
Uses Software
Cites Work
- Unnamed Item
- Solving propositional satisfiability problems
- BerkMin: A fast and robust SAT-solver
- Learning Rate Based Branching Heuristic for SAT Solvers
- The Community Structure of SAT Formulas
- Impact of Community Structure on SAT Solver Performance
- Evaluating CDCL Variable Scoring Schemes
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Theory and Applications of Satisfiability Testing
- The Solution of a Certain Two-Person Zero-Sum Game
- Hardware and Software, Verification and Testing
- Bounded model checking using satisfiability solving