Applying Linear Quantifier Elimination | Zendy

Rüdiger Loos | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Applying Linear Quantifier Elimination

Author(s) -

Rüdiger Loos

Publication year - 1993

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/36.5.450

Subject(s) - quantifier elimination , computation , range (aeronautics) , quadratic equation , mathematics , algorithm , computer science , discrete mathematics , materials science , geometry , composite material

The linear quantifier elimination algorithm for ordered fields in [15] is applicable to a wide range of examplee involving even non-linear parameters. The Skolem sets of the original algorithm are generalized to elimination sets whose size is linear in the number of atomic formulae, whereas the size of Skolem sets is quadratic in this number. Elimination sets may contain non-standard terms which enter the computation symbolically. Many cases can be treated by special methods improving further the empirical computing times

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research