Simplification of Quantifier-Free Formulae over Ordered Fields

Given a quantifier-free first-order formula over the theory of ordered fields, our aim is to find an equivalent first-order formula that issimpler. The notion of a formula being simpler will be specified. An overview is given over various methods combining elements of field theory, order theory, and logic. These methods do not require a Boolean normal form computation. They have been developed and implemented inreducefor simplifying intermediate and final results of automatic quantifier elimination by elimination sets. Their applicability is certainly not restricted to the area of quantifier elimination.

[1]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[2]  Volker Weispfenning,et al.  Comprehensive Gröbner Bases , 1992, J. Symb. Comput..

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

[4]  Hoon Hong,et al.  Testing Stability by Quantifier Elimination , 1997, J. Symb. Comput..

[5]  Allan Borodin,et al.  Decreasing the Nesting Depth of Expressions Involving Square Roots , 1985, J. Symb. Comput..

[6]  Thomas Sturm,et al.  REDLOG: computer algebra meets computer logic , 1997, SIGS.

[7]  Volker Weispfenning,et al.  Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond , 1997, Applicable Algebra in Engineering, Communication and Computing.

[8]  W. Quine.  On Cores and Prime Implicants of Truth Functions , 1959 .

[9]  George E. Collins,et al.  The SAC-2 Computer Algebra System , 1985, European Conference on Computer Algebra.

[10]  Richard Zippel,et al.  Simplification of Expressions Involving Radicals , 1985, J. Symb. Comput..

[11]  David Y. Y. Yun,et al.  On square-free decomposition algorithms , 1976, SYMSAC '76.

[12]  E. Artin.  Über die Zerlegung definiter Funktionen in Quadrate , 1927 .

[13]  Volker Weispfenningy,et al.  Applying Linear Quantiier Elimination , 1993 .

[14]  Volker Weispfenning,et al.  Simulation and Optimization by Quantifier Elimination , 1997, J. Symb. Comput..

[15]  B. F. Caviness,et al.  Simplification of radical expressions , 1976, SYMSAC '76.

[16]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[17]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[18]  Volker Weispfenning,et al.  Quantifier elimination for real algebra—the cubic case , 1994, ISSAC '94.

[19]  Rüdiger Loos,et al.  Applying Linear Quantifier Elimination , 1993, Comput. J..

[20]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[21]  D. McIlroy.  Algebraic Simplification , 1966, CACM.

[22]  Hoon Hong,et al.  Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination , 1992, ISSAC '92.

[23]  George E. Collins,et al.  Partial Cylindrical Algebraic Decomposition for Quantifier Elimination , 1991, J. Symb. Comput..

[24]  Heinz Kredel,et al.  Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .

[25]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[26]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.