SOURCE-LINKED INTELLIGENCE

Extending SMT Solving with Non-Ground Clause Learning

arXiv · AI, language, vision and robotics · article · Sep 10, 2026 · UTC

Quantifier instantiation is currently the main approach to non-ground SMT solving: solvers generate ground instances and solve the resulting ground SMT problems with CDCL(T)-style reasoning. When a conflict is found, conflict analysis learns only a ground clause, even though the conflict comes from instances of non-ground clauses. Yet non-ground reasoning can give exponentially shorter proofs than purely ground reasoning. We propose a calculus that consists of ground instantiations, CDCL(T)-style rules, and non-ground conflict analysis. The solver reasons on ground instances, but the resolutio

Read original source ↗ Open in workspace

recordType

paper

region

Global