Composing constraint solvers

Preprint Aug 2026

Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB

First-order encodings in both TPTP and SMT-LIB formats are provided, together with scripts that automatically generate benchmark instances, and these benchmarks are evaluated on state-of-the-art automated theorem provers and SMT solvers.

Julie Cailler, Noé Delorme, S. Tourret · 0 citations

Preprint Sep 2026

DueList: A Theory of Lists with Combinators for SMT Solvers

This work introduces DueList, an abstraction-refinement approach geared towards list reasoning, which is implemented on top of off-the-shelf SMT solvers and extends reasoning facilities of existing solvers, allowing to conclude about the (un)satisfiability of a larger range of problems, while outperforming existing sol...

Pierre Goutagny, Aymeric Fromherz, Raphaël Monat · 0 citations

A light-weight proof checker for TSTP refutations

A proof checker called Nörgler is introduced that builds upon and extends the established approach pioneered by GDV and supports checking propositional, (untyped and typed) first-order, and higher-order refutations represented in TSTP.

Melanie Taprogge, H. Sariyanto, Alexander Steen · 1 citation

Sep 2026

Integration of Minimal Reasons in AMOSUM Constraints

This paper proposes and formalizes two new minimization algorithms that guarantee subset-minimal reasons and ensures cardinality-minimal reasons in the AMOSUM constraint and demonstrates that extending the solver wasp with these minimization strategies leads to substantial performance improvements.

Salvatore Fiorentino · Intelligenza Artificiale · 0 citations

for Inﬁnite-State Integer Problems

A mature version of sweap is presented with novel features: a dual abstraction approach that improves its capabilities in proving unrealisability, support for nondeterministic and unbounded updates, more general initialization of variables, and equirealisable reductions for optimisation.

Shaun Azzopardi, Luca Di, Nir P. Iterman · 0 citations

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