5 articles tagged with #smt-solvers. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers propose Symbolic Equivalence Partitioning, a novel inference-time selection method for code generation that uses symbolic execution and SMT constraints to identify correct solutions without expensive external verifiers. The approach improves accuracy on HumanEval+ by 10.3% and on LiveCodeBench by 17.1% at N=10 without requiring additional LLM inference.
Researchers introduce LexGuard, an adversarial AI framework that improves legal reasoning in large language models by distinguishing legally relevant changes from irrelevant perturbations. The system uses formal logic and SMT solvers to ground legal decisions in statute interpretation, addressing systematic failures in existing legal AI systems to maintain appropriate sensitivity to material legal facts.
Researchers demonstrate that Fourier Neural Operators (FNOs) used for PDE simulation can be formally verified using SMT solvers by exploiting their piecewise-linear structure once weights are fixed. While exact encoding provides sound proofs and counterexamples on small models, scalability remains limited, revealing a fundamental tradeoff between formal verification rigor and practical applicability for production neural operators.
Researchers demonstrate how functional stable model semantics enhances Answer Set Programming Modulo Theories (ASPMT), enabling integration of intensional functions that derive values from other predicates rather than pre-defined sources. The framework allows tight ASPMT programs to translate into SMT instances, extending the theoretical foundations of logic programming.
Researchers developed Once4All, an LLM-assisted fuzzing framework for testing SMT solvers that addresses syntax validity issues and computational overhead. The system found 43 confirmed bugs in leading solvers Z3 and cvc5, with 40 already fixed by developers.
