逆P-推理与未知信息推理-搜索与发现

摘要

逆P-集合(inverse packet sets)是改进P-集合(packet sets)得到的一个新的数学结构,它是由内逆P-集合(X)F (internal inverse packet set (X)F)与外逆P-集合(X)F(outer inverse packet set (X)F)构成的集合对；或者((X)F,(X)F)是逆P-集合.逆P-集合具有动态特性,逆P-集合的动态特性与另一类信息系统的动态特性相同.P-集合是把动态特性引入到有限普通集合X内,改进有限普通集合X得到的.P-集合具有动态特性,P-集合的动态特性与一类信息系统的动态特性相同.P-集合在一类信息系统中获得了多个应用.P-推理(packet reasoning)是P-集合生成的一个具有动态特性的推理.利用逆P-集合(inverse packet sets)与逆P-推理(inverse packet reasoning)给出逆P-推理与内-外搜索定理、逆P-推理的几何特征,以及逆P-推理与未知信息搜索-辨识的多个基本理论结果与应用.逆P-集合与逆P-推理具有好的应用前景.%Inverse P-sets(inverse packet sets) is a new mathematical structure based on P-sets(packet sets). It is a pair of sets composed of internal inverse P-set XF(internal inverse packet set XF) and outer inverse P-set XF (outer inverse packet setXF),L e. (XF,XF)is inverse P-sets. Inverse P-sets has dynamic characteristics,the dynamic characteristics of inverse P-sets is identical to that of one kind of information systems. P-sets is obtained by introducing dynamic characteristic into ordinary set X,P-sets has dynamic characteristic, the dynamic characteristics of P-sets is identical to that of another kind of information systems. P-sets has been widely applied to this kind information systems. P-reasoning( packet reasoning) is a reasoning model generated by P-sets,and has dynamic characteristics. On basis of inverse P-sets and inverse P-reasoning, theorem of inverse P-reasoning and internal-outer search was given. The geometric characteristics of inverse P-reasoning was given. Several theorems and applications about inverse P-reasoning and unknown information search-identification were given. Inverse P-sets and inverse P-reasoning have extensive property in practical application.