Deep cooperation of CDCL and local search for SAT
From MaRDI portal
Publication:2118286
DOI10.1007/978-3-030-80223-3_6OpenAlexW3183139685MaRDI QIDQ2118286FDOQ2118286
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_6
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
- Theory and Applications of Satisfiability Testing
- Hardware and Software, Verification and Testing
- BerkMin: A fast and robust SAT-solver
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
- A machine program for theorem-proving
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Learning Rate Based Branching Heuristic for SAT Solvers
- Boosting complete techniques thanks to local search methods
- On the effect of learned clauses on stochastic local search
- Improvements to Hybrid Incremental SAT Algorithms
- Boosting Local Search Thanks to cdcl
Uses Software
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)
