Deep cooperation of CDCL and local search for SAT

DOI10.1007/978-3-030-80223-3_6MaRDI QIDQ2118286OpenAlexFDO

Authors Shaowei Cai, X. D. 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

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

Cites work

• A machine program for theorem-proving
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• BerkMin: A fast and robust SAT-solver
• Between SAT and UNSAT: the fundamental difference in CDCL SAT
• Boosting complete techniques thanks to local search methods
• Boosting local search thanks to \textsc{cdcl}
• CCAnr: a configuration checking based local search solver for non-random satisfiability
• Hardware and Software, Verification and Testing
• Improvements to Hybrid Incremental SAT Algorithms
• Learning rate based branching heuristic for SAT solvers
• On the effect of learned clauses on stochastic local search
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Theory and Applications of Satisfiability Testing

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118286)