Metraipolis › archive › dc_211c153edf7e

Extending SMT Solving with Non-Ground Clause Learning — arXiv:2609.11509

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11509
License (as archived)
CC0-1.0
Archived
2026-10-16T05:24:24.897Z
SHA-256 of the archived text
9296ad382c8a8f6917b74c7f115002abd4c846a873f05ba5da36f9ba4d07d67f
Stable URL of this page
https://metraipolis.com/documento/dc_211c153edf7e

How to cite

Extending SMT Solving with Non-Ground Clause Learning — arXiv:2609.11509 — arXiv (en), https://arxiv.org/abs/2609.11509 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_211c153edf7e (Metraipolis archive dc_211c153edf7e, sha256 9296ad382c8a8f6917b74c7f115002abd4c846a873f05ba5da36f9ba4d07d67f)
BibTeX
@misc{dc211c153edf7e,
  title = {Extending SMT Solving with Non-Ground Clause Learning — arXiv:2609.11509},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11509},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_211c153edf7e; sha256 9296ad382c8a8f6917b74c7f115002abd4c846a873f05ba5da36f9ba4d07d67f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11509. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 resolution steps of conflict analysis are performed on their original non-ground clauses. This produces learned clauses that are typically more general than the ground conflict. With a suitable strategy, the learned clauses are even non-redundant. We also show how chronological backtracking can be included in SMT solving. Our calculus gives a common setting for CDCL(T)-style SMT solving, a range of instantiation-based procedures, and non-ground clause learning, and we prove that it simulates CDCL, SCL(FOL), SCL(T), and even Resolution.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-11 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.11509 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:17:52.031Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).