机器证明 meaning in Chinese
mechanical theorem proving
Examples
- Singapore : world scientific , 1994 . 4 li h , wu y . automated theorem proving in projective geometry with cayley and bracket algebras
其中特征列方法是定理机器证明与方程求解的基础，也是数学机械化领域目前研究的核心内容。 - 1 wu w t . on the decision problem and the mechanization of theorem - proving in elementary geometry . scientia sinica , 1978 , : 159 - 172 . re - published in em automated theorem proving : after 25 years , 1984 , pp . 213 - 234
本文第一作者于上世纪七十年代末开始从事数学机械化研究，致力于实现推理与方程求解的自动化，并创立了几何定理机器证明的吴方法与方程求解的特征列方法。 - 14 gallo g , mishra b . efficient algorithms and bounds for wu - ritt characteristic sets . effective methods in algebraic geometry , progress in mathematics , 1991 , : 119 - 142 . 15 gao x s , chou s c . a zero structure theorem for differential parametric systems
本文简要介绍了代数方程组的特征列方法及其在几何定理机器证明发现与含参数代数方程求解中的应用，进一步给出了基于特征列方法代数闭域上的一阶逻辑公式的判定算法。 - In this paper , it s applications were explained from seven different fields , the common zeros of two polynomials , the multiplicities of roots and the discrimination of a polynomial , searching the equations suitable for a algebraic number , implicating a rational curve over the plane , computing the zeros of a nonlinear algebraic equation and gathering the discrimination surface of the sas in automated theorem proving on inequalities
本文从7个方面阐述了结式的应用，包括判断2个多项式的公共零点，判定多项式是否有重根，计算多项式的判别式，寻找代数数满足的方程，平面有理曲线的隐式化，非线性代数方程组求解和不等式机器证明中半代数系统边界曲面的获得等。