2026· International Conference on Theory and Applications of Satisfiability Testing· pp. 9:1-9:18· 0 citations· 41 references
Computer Science
TL;DR
A new proof system for MaxSAT is described, the Comparator Calculus, which models the inferential strategies used in core-guided MaxSAT solvers and two new MaxSAT algorithms are introduced: a core-guided one (CSimple) and one non-core-guided (CSat), which uses heuristics to construct new soft formulas and calls a SAT solver on a single soft formula.
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 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
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 a...
Florian Pollitt, Zachary Battleman, Mathias Fleury et al.· International Conference on...· 1 citation
This paper revisits the theory-independent MCSat framework as a proof system to provide a modern perspective that refines the original formulation of MCSat, and presents a general, theory-agnostic rule scheme for MCSat and instantiate it for several theories, including propositional logic, non-linear real arithmetic, a...
T. Hader, Theo Jauschneg, Daniela Kaufmann et al.· 0 citations
A tailored integration of SAT solving for detecting variants of subsumption in superposition using the Vampire prover and showing that SAT encodings improve literal matching, and thus subsumption, in first-order theorem proving is presented.
Laura Kovács, Tu Wien, Austria et al.· 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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
