{"title":"CGSQE/SyNRAC:一个基于综合Gröbner系统计算的实量词消去包","authors":"Ryoya Fukasaku, Hidenao Iwane, Yosuke Sato","doi":"10.1145/3015306.3015313","DOIUrl":null,"url":null,"abstract":"CGSQE is a Maple package for real quantifier elimination (QE) we are developing. It works cooperating with SyNRAC which is also a Maple package for real QE one of the authors is developing. For a given first order formula, CGSQE eliminates all possible quantifiers using the underlying equational constraints by the computation of comprehensive Gröbner systems (CGSs). In case all quantifiers are not removable, it transforms the given formula into a formula which contains only strict inequalities of quantified variables, then uses a cylindrical algebraic decomposition based real QE program of SyNRAC to remove the remaining quantifiers. The core algorithm of CGSQE is a CGS real QE algorithm which was first introduced by Weispfenning in 1998 and further improved by us in 2015 so that we can make a satisfactorily practical implementation. CGSQE is superior to other real QE implementations for many examples which contain many equational constraints. In the software presentation, we would like to show high-performance computation of CGSQE.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"6 1","pages":"101-104"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"CGSQE/SyNRAC: a real quantifier elimination package based on the computation of comprehensive Gröbner systems\",\"authors\":\"Ryoya Fukasaku, Hidenao Iwane, Yosuke Sato\",\"doi\":\"10.1145/3015306.3015313\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"CGSQE is a Maple package for real quantifier elimination (QE) we are developing. It works cooperating with SyNRAC which is also a Maple package for real QE one of the authors is developing. For a given first order formula, CGSQE eliminates all possible quantifiers using the underlying equational constraints by the computation of comprehensive Gröbner systems (CGSs). In case all quantifiers are not removable, it transforms the given formula into a formula which contains only strict inequalities of quantified variables, then uses a cylindrical algebraic decomposition based real QE program of SyNRAC to remove the remaining quantifiers. The core algorithm of CGSQE is a CGS real QE algorithm which was first introduced by Weispfenning in 1998 and further improved by us in 2015 so that we can make a satisfactorily practical implementation. CGSQE is superior to other real QE implementations for many examples which contain many equational constraints. In the software presentation, we would like to show high-performance computation of CGSQE.\",\"PeriodicalId\":7093,\"journal\":{\"name\":\"ACM Commun. Comput. Algebra\",\"volume\":\"6 1\",\"pages\":\"101-104\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Commun. Comput. Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3015306.3015313\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Commun. Comput. Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3015306.3015313","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
CGSQE是我们正在开发的一个用于实量词消去(QE)的Maple包。它可以与SyNRAC协同工作,SyNRAC也是一位作者正在开发的用于真正QE的Maple包。对于给定的一阶公式,CGSQE通过综合Gröbner系统(CGSs)的计算,利用底层方程约束消除所有可能的量词。在不能去除所有量词的情况下,将给定公式转化为只包含量化变量严格不等式的公式,然后使用SyNRAC的基于圆柱代数分解的实QE程序去除剩余的量词。CGSQE的核心算法是CGS real QE算法,该算法由Weispfenning于1998年首次提出,我们在2015年对其进行了进一步改进,使我们能够做出令人满意的实际实现。对于包含许多方程约束的实例,CGSQE优于其他实际的QE实现。在软件演示中,我们想展示CGSQE的高性能计算。
CGSQE/SyNRAC: a real quantifier elimination package based on the computation of comprehensive Gröbner systems
CGSQE is a Maple package for real quantifier elimination (QE) we are developing. It works cooperating with SyNRAC which is also a Maple package for real QE one of the authors is developing. For a given first order formula, CGSQE eliminates all possible quantifiers using the underlying equational constraints by the computation of comprehensive Gröbner systems (CGSs). In case all quantifiers are not removable, it transforms the given formula into a formula which contains only strict inequalities of quantified variables, then uses a cylindrical algebraic decomposition based real QE program of SyNRAC to remove the remaining quantifiers. The core algorithm of CGSQE is a CGS real QE algorithm which was first introduced by Weispfenning in 1998 and further improved by us in 2015 so that we can make a satisfactorily practical implementation. CGSQE is superior to other real QE implementations for many examples which contain many equational constraints. In the software presentation, we would like to show high-performance computation of CGSQE.