Saltar al contenido
← volver

Verifiable LLM-Guided Focal SMT Solving for Quantified Arrays

arXiv cs.AI · arxiv.org Publicado:

arXiv:2610.39435v1 Announce Type: new Abstract: Large language models can often identify useful semantic structure in formal artifacts, but their outputs cannot be trusted as proofs or solver decisions. We study whether LLMs can instead guide formal reasoning systems through a narrow, solver-verifiable interface. We instantiate this idea in quantified array SMT solving, where modern instantiation-based techniques can fail when key ground terms and equalities are hidden by auxiliary variables, a…

Leer original →

Más de arXiv cs.AI