mlsanityData to 14 Oct 2026

IGMaxHS -- An Incremental MaxSAT Solver with Support for XOR Clauses

arXiv 2410.15897 ↗First posted 21 Oct 2024cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Recently, a novel, MaxSAT-based method for error correction in quantum computing has been proposed that requires both incremental MaxSAT solving capabilities and support for XOR constraints, but no dedicated MaxSAT solver fulfilling these criteria existed yet. We alleviate that and introduce IGMaxHS, which is based on the existing solvers iMaxHS and GaussMaxHS, but poses fewer restrictions on the XOR constraints than GaussMaxHS. IGMaxHS is fuzz tested with xwcnfuzz, an extension of wcnfuzz that can directly output XOR constraints. As a result, IGMaxHS is the only solver that reported neither incorrect unsatisfiability verdicts nor invalid models nor incoherent cost model combinations in a final fuzz testing comparison of all three solvers with 10000 instances. We detail the steps required for implementing Gaussian elimination on XOR constraints in CDCL SAT solvers, and extend the recently proposed re-entrant incremental MaxSAT solver application program interface to allow for incremental addition of XOR constraints. Finally, we show that IGMaxHS is capable of decoding quantum color codes through simulation with the Munich Quantum Toolkit.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 21 references that are in the map. First posted on arXiv 21 Oct 2024.

Builds on

2 of 21 references.

References · 2

  1. 2022Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofscited by 14
  2. 2023Proof Generation for CDCL Solvers Using Gauss-Jordan Eliminationcited by 2

Built on by

Not cited yet.