Research map / Learning theory and algorithms / Combinatorial and search optimization
NuWLS: Improving Local Search for (Weighted) Partial MaxSAT by New Weighting Techniques
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 NuWLS's weight initialization and distinct hard/soft weight updates | SLS for partial MaxSAT · PMS 2019, PMS 2020, PMS 2021, WPMS 2019, WPMS 2020, WPMS 2021 | winning instances: 192 vs 138; 164 vs 113; 86 vs 84; 207 vs 83; 190 vs 58; 80 vs 38 | Helped |
| use NuWLS instead of the strongest SAT-based solver | incomplete (weighted) partial MaxSAT solving · PMS 2019, PMS 2020, PMS 2021, WPMS 2019, WPMS 2020, WPMS 2021 | winning instances: 172 vs 145; 154 vs 110; 73 vs 65; 132 vs 116; 134 vs 98; 64 vs 52 | Helped |
| initialize soft clause weights to their original weights instead of using the proposed initialization (ablation) | NuWLS · PMS 2019 | winning instances: 178 -> 165 | Hurt |
| initialize soft clause weights to their original weights instead of using the proposed initialization (ablation) | NuWLS · PMS 2020 | winning instances: 149 -> 141 | Hurt |
| initialize soft clause weights to their original weights instead of using the proposed initialization (ablation) | NuWLS · PMS 2021 | winning instances: 89 -> 87 | Hurt |
| initialize soft clause weights to their original weights instead of using the proposed initialization (ablation) | NuWLS · WPMS 2019 | winning instances: 180 -> 87 | Hurt |
| initialize soft clause weights to their original weights instead of using the proposed initialization (ablation) | NuWLS · WPMS 2020 | winning instances: 161 -> 72 | Hurt |
| initialize soft clause weights to their original weights instead of using the proposed initialization (ablation) | NuWLS · WPMS 2021 | winning instances: 69 -> 55 | Hurt |
| update hard and soft clause weights under the same conditions instead of distinct conditions (ablation) | NuWLS · PMS 2019 | winning instances: 178 -> 139 | Hurt |
| update hard and soft clause weights under the same conditions instead of distinct conditions (ablation) | NuWLS · PMS 2020 | winning instances: 149 -> 122 | Hurt |
| update hard and soft clause weights under the same conditions instead of distinct conditions (ablation) | NuWLS · PMS 2021 | winning instances: 89 -> 64 | Hurt |
| update hard and soft clause weights under the same conditions instead of distinct conditions (ablation) | NuWLS · WPMS 2019 | winning instances: 180 -> 123 | Hurt |
Closest papers by meaning
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.90)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.87)
- Enhance Diversified Top-k MaxSAT Solving by Incorporating New Strategy for Generating Diversified Initial Assignments (Student Abstract) (AAAI 2024 · similarity 0.86)
- Better Understandings and Configurations in MaxSAT Stochastic Local Search Solvers via Anytime Performance Analysis (AAAI 2025 · similarity 0.85)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.85)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.84)
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.