SAT in Saturation: A Satisfied Match

Laura Kovács Tu Wien Austria Robin Biere Bernhard Coutelier Jakob Gleiss Rath Michael Rawson Alexey Ignatiev Stefan Szeider

· 0 citations · 10 references

TL;DR

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.

Semantic Scholar

View source

Similar papers

Review

Saturation-Guided Inductive Synthesis

This talk overviews recent progress in automating inductive reasoning in quantified logic, with applications to code synthesis, and shows that induction and synthesis are better together in saturation, allowing not only to prove quantified properties F, but also generate a functional implementation of F during proof se...

Laura Kovács · 0 citations

Open access Aug 2026

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.

Julian Danner, Martin Kreuzer · Journal of Artificial Intell... · 0 citations

Open access Jul 2026

A Strategy Language for Controlled Proof Search

This paper introduces the strategy language of Pgeon, a meta-prover with a clear separation between inference rules and proof search, designed to handle the challenge of fair proof search in semi-decidable logics.

Romain Sidhoum, Simon Robillard, David Delahaye · Electronic Proceedings in Th... · 0 citations

2013

The Satisfiability Problem

This book explains how algorithms work, for example, by exploiting the structure of the SAT problem with an appropriate logical calculus, like resolution, but also algorithms based on “physical” principles are considered.

Uwe Schöning, J. Torán · 1 citation

Open access Aug 2026

Proving Total Correctness of Top-Down Solvers with Widening and Narrowing

The top-down solver TD is a generic fixpoint algorithm that can be used to compute partial post-solutions of equation systems for abstract interpretation. We consider two extensions of the TD to deal with infinite strictly ascending chains. For the TD extended with warrowing, we formally prove that it always returns pa...

Sarah Tilscher, Alexandra Graß, Helmut Seidl et al. · Journal of automated reasoni... · 0 citations

Preprint Aug 2026

Structure-Preserving Uncertainty Propagation in First-Order Proof Search

This paper adds structure-preserving quantitative reporting to the framework of GK, a query-directed first-order prover that extends ordinary resolution-based proof search with explicit positive and negative claims, numerical confidence values, and prioritized default rules with exceptions.

T. Tammet · 1 citation