首页> 外文会议>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表示由Confly F = 0÷G = 0定义的真实代数品种,其中F和G是变量X1,...,XR的真实多项式,但是LET S成为RR-2的子胺属。本文提出了对最后2个变量的v对v的分析性脱位的概念。建议,这种概念可以在解决包含结合f = 0的量化的量化问题方面是有用的。使用基于CAD的方法的变型G = 0作为子核。证明了两种双级升降定理,为这种方法提供了基础。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号