Year: 1994
Type: conference-paper
Abstract: We present a special purpose quantifier elimination method that eliminates a quantifier ∃x in formulas ∃x(4) where 4 is a boolean combination of polynomial inequalities of degree ≤3 with respect to x. The method extends the virtual substitution of parametrized test points developed in [Weispfenning 1, Loos &. We ispf.] for the linear case and in [Weispfenning2] for the quadratic case. It has similar upper complexity bounds and offers similar advantages (relatively large preprocessing part, explicit parametric solutions). small examples suggest that the method will be of practical significance.
Author: Volker Weispfenning
Institution: University of Passau
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1966161069
