极小标准综合Groebner系统
Minimal Canonical Comprehensive Groebner Systems
摘要：
这是延续蒙特斯的文件“关于规范的讨论多项式系统的参数”。本文定义了参数理想的最小正则综合Groebner系统（MCCGS），并确定了它存在和可计算的假设条件。给出了一种获得MCCGS的段的规范描述的算法，从而完成了整个MCCGS算法（在Maple中实现）。我们展示了它的高实用性的应用程序，如自动定理证明和发现，并与其他现有的方法进行比较。一种方法来检测一个反例的概述，虽然大量的测试做的证据的存在的MCCGGS。
英文摘要：
This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which hypothesis it exists and is computable. An algorithm to obtain a canonical description of the segments of the MCCGS is given, completing so the whole MCCGS algorithm (implemented in Maple). We show its high utility for applications, like automatic theorem proving and discovering, and compare it with other existing methods. A way to detect a counterexample is outlined, although the high number of tests done give evidence of the existence of the MCCGS.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
