前件推导是定理证明的一种扩展。
在讲定理证明和其他应用之前，还有什么疑问？
OK, any questions, generally speaking, before we move on to the proof and other applications?
也引申出命题逻辑定理证明的一个可信性问题。
Furthermore, it presents a creditability problem about theorem proof in propositional logic.
文中就费马大定理证明的艰难历程作一历史性的评述。
The paper will review historically the difficult course of the proof of Fermat's Great Theorem.
同时，也对四色问题与初等几何定理证明作了简单的讨论。
Additionally, the well-known four colour problem and elementary geometry theorem-proving problem have been discussed.
本文提供的勾股定理证明的教学案例就是一次探究性教学的应用。
The teaching case that the Pythagorean theorem that this text offers proves is the application of probing into teaching.
根据有限时间稳定性定理证明此时闭环系统是全局有限时间稳定的。
By using a finite time stability theorem, it is proved that the closed loop system is globally finite time stable.
定理证明中通常的想法是通过推出空子句的方法来判定子句集的可满足性。
The traditional idea used in TP is to try to deduce the empty clause to check satisfiability.
在检验u ML模型一致性时，把一致性检验问题转化为逻辑定理证明问题。
To check consistency of UML model, the consistency checking is converted to a problem of theorem proving.
文中还给出了等价变换在建模、传函矩阵计算和有关定理证明方面应用的实例。
Meanwhile, the application examples of equivalent transformation in the modeling, transfer function calculating and theorem proving are suggested.
他还爱上了几何学以及几何学中的定理证明，到16岁时就已经精通微积分了。
He fell in love with geometry and its clear proofs, and mastered calculus at age 16.
许多数学家只是把这些恼人的问题简单地弃置一旁，而忙于类似定理证明这样更有趣的事务。
Many mathematicians simply set nettlesome questions like these aside and get back to the more pleasant business of proving theorems.
它演示了少量带有自动化定理证明功能，经过验证的代码它能够支持任意数量的TAL代码。
Demonstrates that a small amount of code verified with automated theorem proving can support an arbitrary large amount of TAL code.
高效地使用定理证明需要对工具的内部操作有坚实的理解并且熟悉数学证明过程。
Effective use of a theorem prover requires a solid understanding of the internal operations of the tool and a familiarity with the mathematical proof process.
最后探讨了拉格朗日中值定理证明中辅助函数的构造方法，以此拓展对定理证明的思路。
Finally discusses the Lagrange mean value theorem proof method of constructing auxiliary function in order to expand on the idea of theorem proving.
包括不变式产生规则，不变式在计算机中的表示和转换，以及定理证明的部分实现方法。
The generation rules, the notation and the transformation of invariants are described. The method of theorem verification is also included.
该方法首先根据协议规范构造全信息项及冗余协议，使用定理证明保证冗余协议的安全性。
It constructs full information items based on requirement to get a redundancy protocol firstly, and then USES theorem proven to prove the security of the designed protocol.
有时抽象本身可能是很大的工作量，以致定理证明程序可能花费过多时间和资源来完成证明。
Sometimes the abstraction itself may be so large that the theorem prover may take an inordinate amount of time and resources to complete the proof.
几何定理证明的前推法能够产生传统形式的可读证明，在定理机器证明领域占有重要的地位。
The forward reasoning for geometry theorem proving can produce the traditional readable proving, thus plays a special role in the mechanical theorem proving.
在微分几何定理证明中，一个定理成立的辅助条件(非退化条件)不是惟一的，但越简单越好。
The subsidiary conditions (or called non-degeneracy conditions) are not one and only that a theorem holds in differential geometry theorem proving.
它演示了自动化技术、TAL和自动化定理证明，从而验证了操作系统中和运行时复杂的低级代码的安全性。
Demonstration of automated techniques, TAL and automated theorem proving, to verify the safety of the complex low-level code in the operating system and run-time.
尽管缺少自动化，高效地使用定理证明器能处理比模型检查器更大的设计并且要求更小的内存。
Although less automatic, efficient usage of a theorem prover can handle much larger designs than model checkers and requires less memory.
纠正了关于赋值图的张量代数的同构定理证明中的一个疏忽，给出了此同构定理一个完整的证明。
An error is corrected and a complete proof of isomorphism theorem for tensor algebras over valued graphs is given.
机器定理证明在数学定理证明、协议验证、软件和硬件的形式化验证等方面发挥出越来越重要的作用。
It has become more and more important that the application of theorem proving on mathematic theorem proving, protocol verification, hardware verification and software verification.
并对“近世代数”（吴品三）、“抽象代数”（徐诚浩）中有关模格维数几个定理证明的遗漏，作了某些补证。
The paper also gives some corrections to several theorems and their proofs about the dimension of the modular lattice ih the books" Modern Algebra" by Wu and "Abstract Algebra" by Xu.
对归结原理的基本概念与推理规则进行了讨论，并在此基础上通过实例探讨了归结推理方法在数学定理证明中的应用。
It discusses carefully the basic concepts and inference rule of the resolution principle. According to the discussion, resolution method is used to prove a mathematical theorem through a example.
提出了一种为指针逻辑设计定理证明器的新技术，该项技术主要是基于变换和替代，已在APL的工具中得以实现。
This paper presents a technique for designing theorem prover which mainly based on transformation and substitution for Pointer Logic. The technique realized as a tool called APL is implemented.
就如何进行大系统空间模块的分解以满足建模的需要，作了理论上的探讨，给出了最优空间分解判定及性质定理证明。
In this paper, how to optimally divide a complicated system for serving the need of system modelling well is studied theoretically. We present the optimal dividing theory and its theorem proving.
即使承认这一看法，西方最早给出勾股定理证明的时间也不会早于公元前585年，即相传毕达哥拉斯出生的那一年。
Even if admit this view, in the western countries the time of first proof of the Pythagoras theorem is not probably early than epoch ago 585 year.
应用单调有界定理证明一类数列的收敛过程中，一般高等数学和数学分析教材中，处理的思路方法不易想到或过程较为繁琐。
In many current textbook, the monotone bounded theorem is used to the proof the convergence of a kind of but this method is uneasy to series, understand.
应用推荐