Evaluating CDCL variable scoring schemes
From MaRDI portal
Publication:3453243
DOI10.1007/978-3-319-24318-4_29zbMATH Open1471.68238OpenAlexW2282536569MaRDI QIDQ3453243FDOQ3453243
Authors: Armin Biere, Andreas Fröhlich
Publication date: 20 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_29
Recommendations
Cites Work
- Theory and Applications of Satisfiability Testing
- Hardware and Software, Verification and Testing
- BerkMin: A fast and robust SAT-solver
- Title not available (Why is that?)
- Graph-Based Algorithms for Boolean Function Manipulation
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- A machine program for theorem-proving
- Inprocessing rules
- The Community Structure of SAT Formulas
- Impact of Community Structure on SAT Solver Performance
- The Fractal Dimension of SAT Formulas
- Title not available (Why is that?)
- Solving propositional satisfiability problems
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Reusing the assignment trail in CDCL solvers
Cited In (10)
- On CDCL-Based Proof Systems with the Ordered Decision Strategy
- Learning Rate Based Branching Heuristic for SAT Solvers
- Efficient all-UIP learned clause minimization
- On dedicated CDCL strategies for PB solvers
- Internal slackening scoring methods
- Preprocessing of propagation redundant clauses
- Preprocessing of propagation redundant clauses
- The External Interface for Extending WASP
- Searching for i-good lemmas to accelerate safety model checking
- SAT solving with reference points
Uses Software
This page was built for publication: Evaluating CDCL variable scoring schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453243)