2026· International Conference on Theory and Applications of Satisfiability Testing· pp. 28:1-28:19· 1 citation· 36 references
Computer Science
TL;DR
This paper revisits previous work on ER, which factors out repeated parts of learned clauses during conflict analysis, and explores how their original strategy benefits from 15 years of improvements in the state-of-the-art solver CaDiCaL, and proposes a new, less intrusive inprocessing approach based on factoring XOR and ITE gates from learned clauses globally.
Solving Boolean polynomial systems, or equivalently, SAT-solving, based on the XNF and the XLIN proof system outperforms classical methods not only theoretically, but based on the new conflict-driven XNF clause learning methods developed here, it is possible to implement an XNF solver with good practical efficiency.
Julian Danner, Martin Kreuzer· Journal of Artificial Intell...· 0 citations
This system description reports on how Kissat’s award-winning techniques were adapted to the full-featured incremental SAT solver CaDiCaL, including clausal congruence closure, clausal equivalence sweeping, and bounded variable addition, to support efficient linear proof production with hints.
Florian Pollitt, Mathias Fleury, Katalin Fazekas et al.· 0 citations
This work presents the first systematic analysis of how leading LCG solvers maintain their SAT encodings, based on source-code inspection and developer correspondence, and proposes a native CDCL framework for CP, replacing SAT literals with atomic constraints, enabling conflict analysis, nogood learning, and nogood pro...
The PALSAT (Progressive Activation Local Search for SAT) incomplete solver is proposed, which integrates the core techniques from both sides, Unit Propagation (UP) and LS, and leads to some promising results.
Mingming Jin, Zhijie Kuang, Jiongzhi Zheng et al.· International Conference on...· 0 citations
It is shown that adding conditional autarkies (as set-blocked clauses) on top of resolution allows efficient refutations of a number of natural combinatorial principles that may occur in SAT benchmarks.
Ilario Bonacina, Maria Luisa Bonet, A. Kolokolova et al.· International Conference on...· 0 citations
This work presents a pipeline that combines LLM-based constraint generation with empirical evaluation and formal verification, and handles MiniZinc’s partial semantics by requiring the base model to be safe and separately proving that the proposed constraint is well-defined for all instances and solutions of the base m...
Philipp Danzinger, Nysret Musliu· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
