New encodings achieve 2n + 2√(2n) + O(n^{1/3}) clauses for AtMostOne, refuting prior optimality conjectures, with a matching lower bound and grid compression yielding 2n + o(n) clauses for AtMost_k when k = o(n^{1/3}).
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
Backtrackable Inprocessing enables sound inprocessing at arbitrary decision levels in incremental SAT solving and solves about 1.5 times as many difficult bounds on 2017 BMC benchmarks compared to global-level preprocessing.
citing papers explorer
-
Near-Optimal Encodings of Cardinality Constraints
New encodings achieve 2n + 2√(2n) + O(n^{1/3}) clauses for AtMostOne, refuting prior optimality conjectures, with a matching lower bound and grid compression yielding 2n + o(n) clauses for AtMost_k when k = o(n^{1/3}).
-
Backtrackable Inprocessing
Backtrackable Inprocessing enables sound inprocessing at arbitrary decision levels in incremental SAT solving and solves about 1.5 times as many difficult bounds on 2017 BMC benchmarks compared to global-level preprocessing.