Geometric Reasoning with Logic and Algebra

Abstract Geometric reasoning is concerned with (geometric) objects that often are definable by formulae of the language of the first-order theory of the real numbers. Certain problems that arise in geometric reasoning can be cast into one of the following forms: query problem—does a certain collection of objects possess a certain (first-order) property; constraint problem—given a quantified formula defining an object, find an equivalent definition by a quantifier-free formula; display problem—describe an object, e.g. determine its dimension or specify its topology. In the last fifteen years, feasible algorithms for the exact solution of these problems have been discovered, implemented, and used to solve nontrivial problems. We give examples of problems that fall within the scope of these methods, provide a tutorial introduction to the principal algorithms currently in use, and describe the solution of the sample problems using those algorithms.

[1]  Scott McCallum,et al.  Cylindrical Algebraic Decomposition by Quantifier Elimination , 1982, EUROCAM.

[2]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[3]  G. E. Collins,et al.  Real Zeros of Polynomials , 1983 .

[4]  Deepak Kapur,et al.  A Refutational Approach to Geometry Theorem Proving , 1988, Artif. Intell..

[5]  Jon Barwise,et al.  An Introduction to First-Order Logic , 1977 .

[6]  Hai-Ping Ko,et al.  Geometry Theorem Proving by Decomposition of Quasi-Algebraic Sets: An Application of the Ritt-Wu Principle , 1988, Artif. Intell..

[7]  Joseph L. Mundy,et al.  Wu's Method and its Application to Perspective Viewing , 1988, Artif. Intell..

[8]  H. Weber.  Lehrbuch der algebra , 1921 .

[9]  Maurice Mignotte,et al.  On Mechanical Quantifier Elimination for Elementary Algebra and Geometry , 1988, J. Symb. Comput..

[10]  Paul J. Cohen,et al.  Decision procedures for real and p‐adic fields , 1969 .

[11]  I. Faux,et al.  Computational Geometry for Design and Manufacture , 1979 .

[12]  G. E. Collins,et al.  Quantifier Elimination for Real Closed Fields: A Guide to the Literature , 1983 .

[13]  Daniel Lazard,et al.  Quantifier Elimination: Optimal Solution for Two Classical Examples , 1988, J. Symb. Comput..

[14]  Markus Lauer.  A solution to Kahan's problem (SIGSAM problem no. 9) , 1977, SIGS.

[15]  R. Loos.  Computing in Algebraic Extensions , 1983 .

[16]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[17]  Dennis S. Arnon,et al.  A cellular decomposition algorithm for semi-algebraic sets , 1979, EUROSAM.

[18]  Dennis S. Arnon.  On Mechanical Quantifier Elimination for Elementary Algebra and Geometry: Solution of a Non-Trivial Problem , 1985, European Conference on Computer Algebra.

[19]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[20]  George E. Collins,et al.  Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..

[21]  Charles N. Delzell.  A continuous, constructive solution to Hilbert's 17th problem , 1984 .

[22]  Dennis S. Arnon,et al.  Topologically reliable display of algebraic curves , 1983, SIGGRAPH.

[23]  William Kahan.  Problem #9: an ellipse problem , 1975, SIGS.

[24]  Bernard Chazelle,et al.  Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity , 1985, TAPSOFT, Vol.1.