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

单个柱形代数胞腔的分层构造

Levelwise construction of a single cylindrical algebraic cell

Jasper Nalbach, Erika Ábrahám, Philippe Specht, Christopher W. Brown, James H. Davenport, Matthew England

AI总结:

针对非线性实数算术SMT问题,本文提出柱形代数胞腔的分层构造方法,通过变量顺序逐层构建、启发式选择投影多项式优化胞腔形状,并以证明系统实现启发式与算法的解耦。

摘要:

可满足性模理论(Satisfiability Modulo Theories, SMT)求解器用于检验无量词一阶逻辑公式的可满足性。本文研究非线性实数算术理论,该理论下的公式是多项式约束的逻辑组合。该领域常用的工具是柱形代数分解(Cylindrical Algebraic Decomposition, CAD),它通过投影多项式将实空间分解为若干胞腔,约束在每个胞腔内的真值保持不变。\n一种改进思路是将CAD理论重构为基于搜索的算法:先猜测满足公式的样本点,再将与约束冲突的猜测泛化为样本周围的柱形胞腔,在后续搜索中避开这些胞腔。这种方法可以更快找到可满足赋值,或用更少的胞腔判定不可满足性。这类方法的典型代表是Jovanović和de Moura提出的NLSAT算法。由于这些胞腔是针对样本局部生成的,所需的投影多项式可能比传统CAD投影更少。原始NLSAT算法仅小幅减少了投影多项式集合,而Brown的单细胞构造方法则大幅减少了投影多项式的数量。不过,生成胞腔的形状和大小取决于多项式的考虑顺序。\n本文提出一种分层构造这类胞腔的方法,即按照变量顺序逐层构建胞腔。该方法仍使用数量缩减的投影多项式,但可考虑多种不同的缩减方式,并通过启发式方法选择投影多项式,以优化正在构造的胞腔形状。本文将所有必要理论表述为一个证明系统:虽然这不是该领域的常见呈现方式,但它能将启发式方法与算法及其正确性证明优雅地解耦。

英文摘要:

Satisfiability Modulo Theories (SMT) solvers check the satisfiability of quantifier-free first-order logic formulas. We consider the theory of non-linear real arithmetic where the formulae are logical combinations of polynomial constraints. Here a commonly used tool is the Cylindrical Algebraic Decomposition (CAD) to decompose real space into cells where the constraints are truth-invariant through the use of projection polynomials. An improved approach is to repackage the CAD theory into a search-based algorithm: one that guesses sample points to satisfy the formula, and generalizes guesses that conflict constraints to cylindrical cells around samples which are avoided in the continuing search. Such an approach can lead to a satisfying assignment more quickly, or conclude unsatisfiability with fewer cells. A notable example of this approach is Jovanović and de Moura's NLSAT algorithm. Since these cells are produced locally to a sample we might need fewer projection polynomials than the traditional CAD projection. The original NLSAT algorithm reduced the set a little; while Brown's single cell construction reduced it much further still. However, the shape and size of the cell produced depends on the order in which the polynomials are considered. This paper proposes a method to construct such cells levelwise, i.e. built level-by-level according to a variable ordering. We still use a reduced number of projection polynomials, but can now consider a variety of different reductions and use heuristics to select the projection polynomials in order to optimise the shape of the cell under construction. We formulate all the necessary theory as a proof system: while not a common presentation for work in this field, it allows an elegant decoupling of heuristics from the algorithm and its proof of correctness.

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

↑