Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
A cluster-based cylindrical algebraic decomposition algorithm
Journal of Symbolic Computation
A bibliography of quantifier elimination for real closed fields
Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An improvement of the projection operator in cylindrical algebraic decomposition
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Quantifier elimination for formulas constrained by quadratic equations
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Parallelization of Quantifier Elimination on a Workstation Network
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Algorithms for the geometry of semi-algebraic sets
Algorithms for the geometry of semi-algebraic sets
An improved projection operation for cylindrical algebraic decomposition (computer algebra, geometry, algorithms)
Improvements in cad-based quantifier elimination
Improvements in cad-based quantifier elimination
The algorithm description language ALDES (report)
ACM SIGSAM Bulletin
Testing Positiveness of Polynomials
Journal of Automated Reasoning
Numerical solution for bounding feasible point sets
Journal of Computational and Applied Mathematics
A hybrid global optimization method: the multi-dimensional case
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
In this paper, we report how certain AI techniques can be used to speed up an algebraic algorithm for deciding the satisfiability of a system of polynomial equations, dis‐equations, and inequalities. We begin by viewing the algebraic algorithm (Cylindrical Algebraic Decomposition) as a search procedure which searches for a solution of the given system. When viewed in this way, the algebraic algorithm is non‐deterministic, in the sense that it can often achieve the same goal, but following different search paths requiring different amounts of computing times. Obviously one wishes to follow the least time‐consuming path. However, in practice it is not possible to determine such an optimal path. Thus it naturally renders itself to the heuristic search techniques of AI. In particular we experimented with Best‐First strategy. We also study a way to prune the search space, which proves to be useful especially when the given polynomial system is not satisfiable. The experimental results indicate that such AI techniques can often help in speeding up the algebraic method, sometimes dramatically.