Skip to content

Author

T. Häder

We have 2 of 38 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Randomized Satisfiability Checking for Non-Linear Arithmetic over Finite Fields

A randomized algorithm is proposed that repeatedly intersects the polynomial system with uniformly random affine linear constraints (hyperplane slices) to progressively reduce the effective dimension of the solution space to address the satisfiability problem in the theory of non-linear arithmetic over finite fields.

A. Goharshady, T. Häder, Laura Kovács et al. · 0 citations
Preprint Jul 2026

A Modern View on MCSat

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.