Evaluating CDCL variable scoring schemes
From MaRDI portal
Publication:3453243
Recommendations
Cites work
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- scientific article; zbMATH DE number 2102695 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- A machine program for theorem-proving
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- BerkMin: A fast and robust SAT-solver
- Graph-Based Algorithms for Boolean Function Manipulation
- Hardware and Software, Verification and Testing
- Impact of Community Structure on SAT Solver Performance
- Inprocessing rules
- Reusing the assignment trail in CDCL solvers
- Solving propositional satisfiability problems
- The community structure of SAT formulas
- The fractal dimension of SAT formulas
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(10)- On CDCL-Based Proof Systems with the Ordered Decision Strategy
- 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
- Learning rate based branching heuristic for SAT solvers
- SAT solving with reference points
Describes a project that uses
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)