DF命题的矩阵归结

Matrix resolution method of dynamic fuzzy proposition

对DFL归结方法作进一步的研究,阐述了DF命题的矩阵归结的理论.对任一DF命题归结反演,得到对应的子句集,采用⊙运算分离DF数和DF命题得到原DF命题的命题归结矩阵,由子句集的不可满足性条件,应用鲁宾逊归结原理,得出DF命题的矩阵归结方法,证明了矩阵归结法的成立定理,并给出了矩阵归结方法的一个推论.

This paper mainly discusses the dynamic fuzzy logic（DFL） resolution method, and expends on the theory of matrix resolution method of dynamic fuzzy proposition. Firstly using the resolution strategy gets obverse clause sets of a dynamic proposition, then using ⊙ Calculus that cut DF number off the DF proposition gets proposition resolution matrix of the original DF proposition. So we can get the matrix resolution method of dynamic fuzzy proposition by applying the condition of dissatisfy of clause sets and the Reubensen resolution principle. We prove matrix resolution method of dynamic fuzzy proposition, and give an inference of the method.