节点文献
拟代数簇包含关系的判定算法
A decidable algorithm for inclusion of quasi-algebraic varieties
【摘要】 判定拟代数簇的包含关系问题不能由计算其相应的饱和理想来确定 .利用一阶逻辑等价公式 ,将拟代数簇的包含关系问题化为检验另一个拟代数簇是否为空的问题 ,之后用 Grobner基方法加以判定 .文中给出了判定算法和计算实例
【Abstract】 The problem of deciding inclusion of quasi-algebraic varieties can not be determined by computing their saturated ideals respectively.In this paper by applying some equivalent formulas in first-order logic,this problem is transformed into one which checks whether another quasi-algebraic variety is empty.Thus it can be solved by Grebner bases method.An decidable algorithm and a computational example are given here.
【关键词】 拟代数簇;
包含关系;
Grobner基方法;
逻辑转换;
判定算法;
【Key words】 quasi-algebraic variety; inclusion; Grbner bases method; logic transformation; decidable algorithm;
【Key words】 quasi-algebraic variety; inclusion; Grbner bases method; logic transformation; decidable algorithm;
【基金】 国家重点基础研究发展规划“数学机械化与自动推理平台”资助项目 (G19980 30 6 )
- 【文献出处】 兰州大学学报 ,Journal of Lanzhou University , 编辑部邮箱 ,2002年01期
- 【分类号】O187.2
- 【下载频次】31