Real quantifier elimination by computation of comprehensive Gröbner systems

Ryoya Fukasaku, Hidenao Iwane, Yosuke Sato

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

A real quantifier elimination method based on the theory of real root counting and the computation of comprehensive Gröbner systems introduced by V. Weispfenning is studied in more detail. We introduce a simpler and more intuitive algorithm which is shown to be an improvement of the original algorithm. Our algorithm is implemented on the computer algebra system Maple using a recent algorithm to compute comprehensive Gröbner systems together with several simplification techniques. According to our computation experiments, our program is superior to other existing implementations for many examples which contain many equalities.

Original languageEnglish
Title of host publicationISSAC 2015 - Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation
PublisherAssociation for Computing Machinery
Pages173-180
Number of pages8
ISBN (Electronic)9781450334358
DOIs
Publication statusPublished - Jun 24 2015
Externally publishedYes
Event40th ACM International Symposium on Symbolic and Algebraic Computation, ISSAC 2015 - Bath, United Kingdom
Duration: Jul 6 2015Jul 9 2015

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
Volume2015-June

Conference

Conference40th ACM International Symposium on Symbolic and Algebraic Computation, ISSAC 2015
Country/TerritoryUnited Kingdom
CityBath
Period7/6/157/9/15

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Real quantifier elimination by computation of comprehensive Gröbner systems'. Together they form a unique fingerprint.

Cite this