首页> 外文会议>International symposium on Symbolic and algebraic computation >On delineability of varieties in CAD-based quantifier elimination with two equational constraints
【24h】

On delineability of varieties in CAD-based quantifier elimination with two equational constraints

机译:基于两个方程约束的基于CAD的量词消除中的品种可描绘性

获取原文

摘要

Let V ⊂ Rr denote the real algebraic variety defined by the conjunction f = 0 ∧ g = 0, where f and g are real polynomials in the variables x1, ..., xr and let S be a submanifold of Rr-2. This paper proposes the notion of the analytic delineability of V on S with respect to the last 2 variables. It is suggested that such a notion could be useful in solving more efficiently certain quantifier elimination problems which contain the conjunction f = 0 ⊂ g = 0 as subformula, using a variation of the CAD-based method. Two bi-equational lifting theorems are proved which provide the basis for such a method.
机译:令V⊂Rr表示由连接点f = 0∧g = 0定义的实数代数,其中f和g是变量x1,...,xr的实多项式,并且S是Rr-2的子流形。本文针对后两个变量提出了V在S上的解析可分性的概念。建议使用基于CAD方法的变体,在更有效地解决某些量词消除问题方面有用,该问题包含连词f = 0⊂g = 0作为子公式。证明了两个双方程提升定理,它们为这种方法提供了基础。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号