Research map / Learning theory and algorithms / Combinatorial and search optimization
Augmenting the Power of (Partial) MaxSat Resolution with Extension
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 |
|---|---|---|---|
| extract cost 1 with MaxResE extension rule and solve the residual instead of the original soft PHP | soft PHP with SAT and MaxSAT solvers · PHP, 5-75 holes | solving time: residuals solved in less than 20 seconds | Helped |
| add extension rule to MaxSAT resolution | MaxRes proof system · hard and soft PHP refutation | refutation length: O(m^3) length | Helped |
Closest papers by meaning
- Improved Algorithms for Maximum Satisfiability and Its Special Cases (AAAI 2023 · similarity 0.90)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.90)
- MaxSAT Resolution With the Dual Rail Encoding (AAAI 2018 · similarity 0.89)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.88)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.84)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · 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.