arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.14634cs.LO
收藏

超越急切编码:SMT中理论引理枚举的理论无关方法

Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT

University of Trento(特伦托大学);Rice University(莱斯大学)

Emanuele Civini, Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani

AI总结:

提出一种理论无关的引理枚举方法,通过分治、投影枚举和理论驱动分区等技术,高效生成完整理论引理集,显著提升SMT求解的扩展性。

摘要:

将布尔推理技术提升到SMT级别通常需要生成理论引理,以排除理论不一致的真值赋值。在标准SMT求解中,通常是在搜索过程中“懒惰地”按需生成此类引理;而对于一些较难的SMT级任务——如unsat-core提取、MaxSMT、T-OBDD或T-SDD编译——预先“急切地”计算所有所需理论引理可能是有益甚至必要的。虽然原则上“经典”的急切SMT编码可以完成这项工作,但它们仅适用于少数简单的理论,不兼容理论组合,并且可能产生大量不必要的引理。在本文中,我们提出了理论无关的方法,用于枚举针对给定公式定制的完整理论引理集。以AllSMT作为基线方法,我们提出了改进的引理枚举技术,包括分治、投影枚举和理论驱动分区,这些技术高度可并行化,并能显著提高可扩展性。实验评估表明,这些技术显著提升了效率,使该方法能够扩展到更复杂的实例。

英文摘要:

Lifting Boolean-reasoning techniques to the SMT level most often requires producing theory lemmas that rule out theory-inconsistent truth assignments. With standard SMT solving, it is common to "lazily" generate such lemmas on demand during the search; with some harder SMT-level tasks -- such as unsat-core extraction, MaxSMT, T-OBDD or T-SDD compilation -- it may be beneficial or even necessary to "eagerly" pre-compute all the needed theory lemmas upfront. Whereas in principle "classic" eager SMT encodings could do the job, they are specific for very few and easy theories, they do not comply with theory combination, and may produce lots of unnecessary lemmas. In this paper, we present theory-agnostic methods for enumerating complete sets of theory lemmas tailored to a given formula. Starting from AllSMT as a baseline approach, we propose improved lemma-enumeration techniques, including divide&conquer, projected enumeration, and theory-driven partitioning, which are highly parallelizable and which may drastically improve scalability. An experimental evaluation demonstrates that these techniques significantly enhance efficiency and enable the method to scale to substantially more complex instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑