Metraipolis › archive › dc_65609845bb0c

A Non-CDCL SAT Solver with Early Conflict Detection: The Watched-Literal-Based CSFLOC Solver — arXiv:2608.24255

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.24255
License (as archived)
CC0-1.0
Archived
2026-10-18T07:06:55.424Z
SHA-256 of the archived text
851f303faaf2a8f084428cf4487c1d02161e788c26d52f8d394b48d37f0ae9e8
Stable URL of this page
https://metraipolis.com/documento/dc_65609845bb0c

How to cite

A Non-CDCL SAT Solver with Early Conflict Detection: The Watched-Literal-Based CSFLOC Solver — arXiv:2608.24255 — arXiv (en), https://arxiv.org/abs/2608.24255 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_65609845bb0c (Metraipolis archive dc_65609845bb0c, sha256 851f303faaf2a8f084428cf4487c1d02161e788c26d52f8d394b48d37f0ae9e8)
BibTeX
@misc{dc65609845bb0c,
  title = {A Non-CDCL SAT Solver with Early Conflict Detection: The Watched-Literal-Based CSFLOC Solver — arXiv:2608.24255},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.24255},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_65609845bb0c; sha256 851f303faaf2a8f084428cf4487c1d02161e788c26d52f8d394b48d37f0ae9e8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24255. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

CSFLOC is a non-CDCL SAT decision procedure based on counting subsumed full-length ordered clauses. The classical CSFLOC loop traverses the ordered space of full-length clauses by a monotone counter: if the current full-length clause is not subsumed by the input formula, its negation is a satisfying assignment; otherwise, a subsuming clause determines a counter jump. The main bottleneck is the repeated search for such a subsuming clause. This paper presents CSFLOC-WL, and its current implementation CSFLOC-WL3, in which this search is replaced by watched-literal prefix propagation over the negation of the current full-length clause represented by the counter. The central mechanism is early conflict detection: if propagation under a common prefix derives opposite unit consequences for the same variable, then the two reason clauses are resolved immediately and the resolvent is used as a new counter-jump cause. The resulting solver is not a CDCL solver: it has no CDCL decision tree, no restart policy, and no first-UIP backjumping loop. It remains a counter-guided full-length-clause-counting solver, but it imports the watched-literal data structure and reason clauses as engineering tools for discovering jumps. Experiments on selected UNSAT SATLIB instances compare CSFLOC-WL3 with CSFLOC21TU and CaDiCaL 3.0.0. The results are mixed: CSFLOC-WL3 is strong on several random 3-SAT instances near the random-3-SAT satisfiability threshold, whereas CSFLOC21TU remains faster on several structured cases, apparently because it contains a more mature cache mechanism that is not yet present in CSFLOC-WL3.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-26 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.24255 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T07:02:03.043Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).