Simplification of Quantifier-Free Formulae over Ordered Fields

@article{Dolzmann1997SimplificationOQ,
  title={Simplification of Quantifier-Free Formulae over Ordered Fields},
  author={Andreas Dolzmann and Thomas Sturm},
  journal={J. Symb. Comput.},
  year={1997},
  volume={24},
  pages={209-231}
}
Good simpliication strategies are essential for implementing any kind of eeective real quantiier elimination. Given a quantiier-free rst-order formula over the theory of ordered elds, the aim is to nd an equivalent rst-order formula that is simpler. The notion of a formula being simpler will be speciied. An overview is given over various methods, which we have implemented in reduce. Our methods have been developed for simplifying intermediate and nal results of automatic quantiier elimination… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 60 extracted citations

Development of SyNRAC-Formula Description and New Functions

International Conference on Computational Science • 2004
View 3 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond

Applicable Algebra in Engineering, Communication and Computing • 1997
View 5 Excerpts
Highly Influenced

Redlog , a Reduce Library of Algorithms for the Manipulation of First - Order Formulas

V. Weispfenning
Universit  at Passau . Unpublished . • 1995
View 1 Excerpt

Using quanti er elimination to test stability

R. Loos, V. Weispfenning
1995

Die MASImplementation des Algorithmus zur Berechnung umfassender Gr  obnerbasen

W. V. Quine
1994

Applying linear quanti er elimination

E. Nolden
The Computer Journal • 1993

Comprehensive Gröbner Bases

J. Symb. Comput. • 1992
View 1 Excerpt

Quanti er Elimination : Optimal Solution for Two Classical Examples

R. Liska, S. Steinberg
Journal ofSymbolic Computation • 1988

Similar Papers

Loading similar papers…