Theorems and algorithms: an interface between Isabelle and Maple
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A survey of the Theorema project
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Nonlinear control system design by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Simulation and optimization by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Deciding linear-trigonometric problems
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Deciding linear-exponential problems
ACM SIGSAM Bulletin
Modern Control Systems
Integrating Computer Algebra into Proof Planning
Journal of Automated Reasoning
Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation
Journal of Automated Reasoning
Reasoning About the Reals: The Marriage of HOL and Maple
LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Hi-index | 0.00 |
This paper presents a decision procedure for problems relating polynomial and transcendental functions. The procedure applies to functions that are continuously differentiable with a finite number of points of inflection in a closed convex set. It decides questions of the form 'is f~0?', where ~@?{=,,