QEPCAD B: a system for computing with semi-algebraic sets via cylindrical algebraic decomposition

SIGSAM Bull. Pub Date : 2004-03-01 DOI:10.1145/980175.980185
Christopher W. Brown
{"title":"QEPCAD B: a system for computing with semi-algebraic sets via cylindrical algebraic decomposition","authors":"Christopher W. Brown","doi":"10.1145/980175.980185","DOIUrl":null,"url":null,"abstract":"QEPCAD B<sup>2</sup> is a system for computing with semi-algebraic sets. a <i>semi-algebraic set</i> is a subset of ℝ<sup><i>n</i></sup> that can be defined as the set of points satisfying a boolean formula combining polynomial equalities and inequalities in the variables <i>x</i><sub>1</sub>,...,<i>x</i><sub><i>n</i></sub>. So, for example, the upper-right quadrant of the unit disk is a semi-algebraic set, since it has the defining formula[see pdf for formula]Many important problems in mathematics, science and engineering boil down to questions about semi-algebraic sets. QEPCAD B allows its users to compute with semi-algebraic sets specified by defining formulae. Computation is exact and symbolic, results being returned in the same language of defining formulae. The basic operations the system supports are <i>formula simplification</i> and <i>quantifier elimination</i><b>Quantifier Elimination:</b> Adding quantifiers to a defining formula is, in a sense, asking a question. For example, ∃<i>x</i>[<i>x</i><sup>2</sup>+<i>bx</i>+<i>c</i>=0] is the question \"when does <i>x</i><sup>2</sup>+<i>bx</i>+<i>c</i> have a real root?\" The well-known answer \"when <i>b</i><sup>2</sup>−4<i>c</i>≥0\" is an equivalent formula from which the quantified variable has been eliminated. Quantifier elimination algorithms, which produce such equivalent formulae, can be seen as providing \"answers\" to \"questions\" about semi-algebraic sets.<b>Formula Simplification:</b> Many procedures in mathematics, performed both manually and mechanically, produce \"answers\" in the form of defining formulae. These defining formulae are often not particularly nice characterizations of the sets they define--hence the need for formula simplification. For example, QEPCAD B determines that the formula<i>F</i>:=1+<i>b</i><sup>2</sup>−<i>c</i><sup>2</sup>≥<i>b</i>∧−<i>c</i>(<i>b</i><sup>2</sup>−<i>c</i><sup>2</sup>)<sup>3</sup>+3<i>b</i><sup>2</sup><i>c</i>(<i>b</i><sup>2</sup>−<i>c</i><sup>2</sup>)∨<i>b</i><sup>2</sup>−<i>c</i><sup>2</sup><<i>b</i>under the assumption <i>b</i> > 0 ∧ <i>c</i> > 0 ∧ 1 < <i>b</i> + <i>c</i> ∧ <i>b</i> < 1 + <i>c</i> ∧ <i>c</i> < 1 = <i>b</i> is equivalent to <i>F</i>′ := <i>c</i><sup>2</sup> − <i>bc</i> − 1 > 0. Obviously, <i>F</i>′ was a considerably better characterization for subsequent computations in the application from which this arose.<b>Cylindrical Algebraic Decomposition (CAD):</b> A CAD is essentially a data-structure providing an explicit representation of a semi-algebraic set. This representation is expensive to compute, but it contains so much information about the set it represents that quantifier elimination and simplification are easily accomplished, which is why CAD is the basis for these operations in QEPCAD B. A little insight into what CAD is and how it is used is provided by the following figures, produced by QEPCAD B, which show the CAD representation for the formula <i>F</i> from the simplification example, followed by the CAD representing <i>F</i> restricted by the given assumptions, followed by the simplified CAD representation of the same set, which is what was used to provide the simplified output formula <i>F</i>′.This exhibit focuses on using QEPCAD B as a problem-solving tool. Examples trace problems from the application areas from which they arise, through the initial formulation of quantifier elimination or formula simplification problems, through refining problem formulations to take advantage of QEPCAD B's strengths and avoid its weaknesses. Limitations of the system and tradeoffs versus other tools are also discussed.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/980175.980185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

Abstract

QEPCAD B2 is a system for computing with semi-algebraic sets. a semi-algebraic set is a subset of ℝn that can be defined as the set of points satisfying a boolean formula combining polynomial equalities and inequalities in the variables x1,...,xn. So, for example, the upper-right quadrant of the unit disk is a semi-algebraic set, since it has the defining formula[see pdf for formula]Many important problems in mathematics, science and engineering boil down to questions about semi-algebraic sets. QEPCAD B allows its users to compute with semi-algebraic sets specified by defining formulae. Computation is exact and symbolic, results being returned in the same language of defining formulae. The basic operations the system supports are formula simplification and quantifier eliminationQuantifier Elimination: Adding quantifiers to a defining formula is, in a sense, asking a question. For example, ∃x[x2+bx+c=0] is the question "when does x2+bx+c have a real root?" The well-known answer "when b2−4c≥0" is an equivalent formula from which the quantified variable has been eliminated. Quantifier elimination algorithms, which produce such equivalent formulae, can be seen as providing "answers" to "questions" about semi-algebraic sets.Formula Simplification: Many procedures in mathematics, performed both manually and mechanically, produce "answers" in the form of defining formulae. These defining formulae are often not particularly nice characterizations of the sets they define--hence the need for formula simplification. For example, QEPCAD B determines that the formulaF:=1+b2c2b∧−c(b2c2)3+3b2c(b2c2)∨b2c2<bunder the assumption b > 0 ∧ c > 0 ∧ 1 < b + cb < 1 + cc < 1 = b is equivalent to F′ := c2bc − 1 > 0. Obviously, F′ was a considerably better characterization for subsequent computations in the application from which this arose.Cylindrical Algebraic Decomposition (CAD): A CAD is essentially a data-structure providing an explicit representation of a semi-algebraic set. This representation is expensive to compute, but it contains so much information about the set it represents that quantifier elimination and simplification are easily accomplished, which is why CAD is the basis for these operations in QEPCAD B. A little insight into what CAD is and how it is used is provided by the following figures, produced by QEPCAD B, which show the CAD representation for the formula F from the simplification example, followed by the CAD representing F restricted by the given assumptions, followed by the simplified CAD representation of the same set, which is what was used to provide the simplified output formula F′.This exhibit focuses on using QEPCAD B as a problem-solving tool. Examples trace problems from the application areas from which they arise, through the initial formulation of quantifier elimination or formula simplification problems, through refining problem formulations to take advantage of QEPCAD B's strengths and avoid its weaknesses. Limitations of the system and tradeoffs versus other tools are also discussed.
QEPCAD B:一个半代数集的圆柱代数分解计算系统
QEPCAD B2是一个半代数集计算系统。半代数集是一个子集,它可以定义为满足布尔公式的点的集合,该布尔公式结合了变量x1,…,xn中的多项式等式和不等式。因此,例如,单位圆盘的右上象限是一个半代数集,因为它有定义公式[见pdf中的公式]许多数学、科学和工程中的重要问题归结为关于半代数集的问题。QEPCAD B允许用户使用定义公式指定的半代数集进行计算。计算是精确和符号化的,返回的结果与定义公式的语言相同。该系统支持的基本操作是公式简化和量词消除。量词消除:在定义公式中添加量词,在某种意义上说,就是提出一个问题。例如,∃x[x2+bx+c=0]是一个问题" x2+bx+c何时有实根?"众所周知的答案“当b2−4c≥0时”是一个等效公式,其中已经消除了量化变量。产生这种等价公式的量词消去算法,可以看作是为半代数集的“问题”提供了“答案”。公式简化:数学中的许多程序,无论是手工还是机械地执行,都以定义公式的形式产生“答案”。这些定义公式通常不能很好地描述它们所定义的集合——因此需要简化公式。例如,QEPCAD B确定公式af:=1+b2−c2≥B∧−c(b2−c2)3+3b2c(b2−c2)在假设B > 0∧c > 0∧1 < B + c∧B < 1+ c∧c < 1 = B下等价于F ':= c2−bc−1 > 0。显然,对于由此产生的应用程序中的后续计算,F '是一个更好的表征。柱面代数分解(CAD): CAD本质上是一种数据结构,提供半代数集的显式表示。这种表示的计算成本很高,但它包含了关于它所代表的集合的大量信息,因此量词的消除和简化很容易完成,这就是为什么CAD是QEPCAD B中这些操作的基础,下面的图提供了对CAD是什么以及如何使用CAD的一点见解,由QEPCAD B生成,它显示了简化示例中公式F的CAD表示。然后是在给定假设条件下表示F的CAD,然后是同一集合的简化CAD表示,这是用来提供简化输出公式F '的。本展览重点介绍如何使用QEPCAD B作为解决问题的工具。示例从问题产生的应用领域追溯问题,通过量词消除或公式简化问题的初始表述,通过改进问题表述以利用QEPCAD B的优点并避免其缺点。还讨论了系统的局限性以及与其他工具的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信