@article{XU2015146,
    Abstract = {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.},
    Author = {Xu, Ming and Li, Zhi-Bin and Yang, Lu},
    File = {Quantifier elimination for a class of exponential polynomial formulas - 1-s2.0-S0747717114000832-main - a - n.pdf},
    ISSN = {0747-7171},
    Journal = {Journal of Symbolic Computation},
    Keywords = {Exponential polynomials, Cylindrical algebraic decomposition, Quantifier elimination, Decision procedures, Interval arithmetic},
    Pages = {146 - 168},
    Title = {Quantifier elimination for a class of exponential polynomial formulas},
    URL = {http://www.sciencedirect.com/science/article/pii/S0747717114000832},
    Volume = {68},
    Year = {2015},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0747717114000832},
    bdsk-url-2 = {https://doi.org/10.1016/j.jsc.2014.09.015},
    date-added = {2020-05-06 16:06:09 +0200},
    date-modified = {2020-05-06 16:06:09 +0200},
    doi = {10.1016/j.jsc.2014.09.015}
}

@article{XU2015146, Abstract = {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.}, Author = {Xu, Ming and Li, Zhi-Bin and Yang, Lu}, File = {Quantifier elimination for a class of exponential polynomial formulas - 1-s2.0-S0747717114000832-main - a - n.pdf}, ISSN = {0747-7171}, Journal = {Journal of Symbolic Computation}, Keywords = {Exponential polynomials, Cylindrical algebraic decomposition, Quantifier elimination, Decision procedures, Interval arithmetic}, Pages = {146 - 168}, Title = {Quantifier elimination for a class of exponential polynomial formulas}, URL = {http://www.sciencedirect.com/science/article/pii/S0747717114000832}, Volume = {68}, Year = {2015}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0747717114000832}, bdsk-url-2 = {https://doi.org/10.1016/j.jsc.2014.09.015}, date-added = {2020-05-06 16:06:09 +0200}, date-modified = {2020-05-06 16:06:09 +0200}, doi = {10.1016/j.jsc.2014.09.015} }

Library Size: 13G (12941 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge