跳到主要导航 跳到搜索 跳到主要内容

Quantifier elimination for a class of exponential polynomial formulas

  • CAS - Chengdu Institute of Computer Application
  • East China Normal University

科研成果: 期刊稿件文章同行评审

摘要

Quantifier elimination is a foundational issue in the field of algebraic and logic computation. In first-order logic, every formula is well composed of atomic formulas by negation, conjunction, disjunction, and introducing quantifiers. It is often made quite complicated by the occurrences of quantifiers and nonlinear functions in atomic formulas. In this paper, we study a class of quantified exponential polynomial formulas extending polynomial ones, which allows the exponential to appear in the first variable. We then design a quantifier elimination procedure for these formulas. It adopts the scheme of cylindrical decomposition that consists of four phases-projection, isolation, lifting, and solution formula construction. For the non-algebraic representation, the triangular systems are introduced to define transcendental coordinates of sample points. Based on that, our cylindrical decomposition produces projections for input variables only. Hence the procedure is direct and effective.

源语言英语
页(从-至)146-168
页数23
期刊Journal of Symbolic Computation
68
P1
DOI
出版状态已出版 - 1 5月 2015

指纹

探究 'Quantifier elimination for a class of exponential polynomial formulas' 的科研主题。它们共同构成独一无二的指纹。

引用此