Deep cooperation of CDCL and local search for SAT

DOI10.1007/978-3-030-80223-3_6OpenAlexW3183139685MaRDI QIDQ2118286

Shaowei Cai, Xindi Zhang

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_6

zbMATH Keywords

local searchCDCLapplication benchmarks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• HaifaSat
• MiniSat
• Chaff
• BerkMin
• Glucose
• COMiniSatPS
• Lingeling
• CaDiCaL
• CCAnr
• Sparrow2Riss
• Paracooba
• Kissat

Cites Work

• Boosting complete techniques thanks to local search methods
• BerkMin: A fast and robust SAT-solver
• On the effect of learned clauses on stochastic local search
• Learning Rate Based Branching Heuristic for SAT Solvers
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
• Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• Improvements to Hybrid Incremental SAT Algorithms
• Boosting Local Search Thanks to cdcl
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving
• Hardware and Software, Verification and Testing

This page was built for publication: Deep cooperation of CDCL and local search for SAT