Skip Navigation

The Computer Journal 1993 36(5):450-462; doi:10.1093/comjnl/36.5.450
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (42)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Loos, R.
Right arrow Articles by Weispfenning, V.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Applying Linear Quantifier Elimination

R. Loos1 * and V. Weispfenning2 §

1 Wilhelm-Schickard-Institut, Universita;t Tubingen, D-72076 Tubingen, Germany, 2 Lehrstuhl fur Mathematik, Universitat Passau, D-94030 Passau, Germany

The linear quantifier elimination algorithm for ordered fields in [15] is applicable to a wide range of examples 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 formulas, 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.

Received January 1993. revised May 1993.

* Wilhelm-Schickard-Institut, Universität Tübingen, D-72076 Tübingen, Germany

§ Lehrstuhl für Mathematik, Universität Passau, D-94030 Passau, Germany


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.