Computer algebra: symbolic and algebraic computation (2nd ed.)
Towards computing non algebraic cylindrical decompositions
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
Solving one and two-dimensional exponential polynomial systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Deciding linear-trigonometric problems
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
New complexity bounds for cylindrical decompositions of sub-pfaffian sets
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Polynomial real root isolation by differentiation
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Cylindrical decomposition for systems transcendental in the first variable
Journal of Symbolic Computation
Deciding polynomial-transcendental problems
Journal of Symbolic Computation
Real root isolation of multi-exponential polynomials with application
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Symbolic termination analysis of solvable loops
Journal of Symbolic Computation
Hi-index | 0.00 |
This paper presents a decision procedure for a certain class of sentences of first order logic involving integral polynomials and the exponential function in which the variables range over the real numbers. The inputs to the decision procedure are prenex sentences in which only the outermost quantified variable can occur in the exponential function. The decision procedure has been implemented in the computer logic system REDLOG. Closely related work is reported in [2, 7, 16, 20, 24].