papersSEP 12 04:00 UTC
New Method Learns Non-Ground Clauses in SMT Solving
A new arXiv paper addresses a limitation in satisfiability modulo theories (SMT) solvers that handle quantified formulas by generating ground instances. In existing CDCL(T)-style pipelines, conflict analysis can only derive learned clauses over ground terms, which the authors argue restricts reasoning power. The work extends conflict-driven learning so that non-ground clauses can be learned directly during solving.