Saturation-Guided Inductive Synthesis

SAT in Saturation: A Satisfied Match

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.

Interactive Proofs in Higher-Order Logic with Errors and Application to Concrete Cryptography

This paper introduces a proof term calculus with dedicated features for bounds, for which an elaborator can automatically infer bound-related manipulations, improving usability and reducing user inputs, and theoretically argues for its usability through an erasability theorem.

Proof-Relevant Interpolation: Beyond Cut-Free and Sequent Proofs

Beyond Core-Guided MaxSAT

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 s...

Proof Production for Satisfiability Modulo Finite Fields with Proof Checking in Pacheck and Lean

This work proposes a proof calculus that captures the decision procedure for finite field reasoning employed by the SMT solver CVC 5 and instrumenting the solver to generate proofs within this calculus, and introduces an extension of the Practical Algebraic Calculus that mirrors the proposed system.

Conflict-Driven SAT Solving using XOR-OR-AND Normal Forms

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.