摘要
可拓学是解决矛盾问题的学科,在可拓学的可拓模型原型的基础上,明确了计算机解决矛盾问题的可拓模型,它包括三部分:关联函数、可拓知识和推理算法,其中关联函数和可拓知识对不同的问题需要利用不同的原理,且它们是逐步变化的.在可拓知识中,关联函数的可拓变换需要通过计算证明其值是逐步增加的.这样,矛盾问题在计算机中才能得到解决.本文通过多个实例来说明解决矛盾问题的可拓模型及可拓知识的建立和实现.
The extension theory is the solution discipline of contradictory question. This paper on base of the extension model prototype in extension theory has put forward the computer aided extension model with reasoning abilities, including three parts; Dependent Function, Extension Knowledge and Reasoning Algorithm. The dependent function and the extension knowledge need to use the different principle to for the different question, and they are change gradually. In the extension knowledge, dependent function＇s extension transformation needs through the computation to prove that its value is increases gradually. Such contradictory problem can be solved in the computer. This paper showed through many examples how the extension model and the extension knowledge are established and realized to solve contradictory problems.
出处
《数学的实践与认识》
CSCD
北大核心
2009年第4期168-172,共5页
Mathematics in Practice and Theory
基金
国家自然科学基金资助项目(70671031)
关键词
矛盾问题
可拓模型
关联函数
可拓变换
可拓知识
contradiction problems
extension model
dependent function
extension transformation
extension knowledge
