Evaluating CDCL Variable Scoring Schemes

DOI10.1007/978-3-319-24318-4_29zbMath1471.68238OpenAlexW2282536569MaRDI QIDQ3453243

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

On CDCL-Based Proof Systems with the Ordered Decision Strategy ⋮ Preprocessing of propagation redundant clauses ⋮ The External Interface for Extending WASP ⋮ Learning Rate Based Branching Heuristic for SAT Solvers ⋮ Preprocessing of propagation redundant clauses ⋮ Efficient all-UIP learned clause minimization ⋮ On dedicated CDCL strategies for PB solvers

Uses Software

• HaifaSat
• MiniSat
• Siege
• SATO
• Chaff
• BerkMin
• PicoSAT
• Glucose
• Lingeling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving propositional satisfiability problems
• BerkMin: A fast and robust SAT-solver
• The Community Structure of SAT Formulas
• Inprocessing Rules
• Impact of Community Structure on SAT Solver Performance
• The Fractal Dimension of SAT Formulas
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• Graph-Based Algorithms for Boolean Function Manipulation
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing
• Hardware and Software, Verification and Testing

This page was built for publication: Evaluating CDCL Variable Scoring Schemes