Research map / Learning theory and algorithms / Combinatorial and search optimization
Should Algorithms for Random SAT and Max-SAT Be Different?
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use ProMS instead of CCLS | random 3-CNF Max-SAT · v70c900 | opt. unsatisfied clauses: 39.2 -> 39.0 | Helped |
| Use ProMS instead of CCLS | random 3-CNF Max-SAT · v90c1000 | opt. unsatisfied clauses: 37.9 -> 37.8 | Helped |
| Use ProMS instead of CCLS | random 3-CNF Max-SAT · v80c800 | opt. unsatisfied clauses: 27.3 -> 27.3 | No clear effect |
| Use make value in variable selection | random high-ratio Max-SAT local search · random 3-CNF benchmarks | solution quality | Helped |
| Use a SAT-oriented break-only strategy (probSAT) instead of ProMS | random high-ratio Max-SAT · random 3-CNF benchmarks | solution quality | Hurt |
| Use break-value-only WalkSAT heuristics (MaxWalkSAT) instead of ProMS | random high-ratio Max-SAT · random 3-CNF benchmarks | solution quality | Hurt |
| Increase preference for high-make variables as the clause-to-variable ratio rises | ProMS variable selection · high-ratio random k-CNF | expected random-walk progress | Helped |
Closest papers by meaning
- Satisfiability and Algorithms for Non-uniform Random k-SAT (AAAI 2021 · similarity 0.89)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.86)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.86)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.84)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.84)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.