Backward P-reasoning and Attribution Residual Discovery-Application

Using P-reasoning(P=Packet),backward P-reasoning was presented,which is abbreviated to P-1-reasoning.P-1-reasoning is consisted of internal P-1-reasoning and outer P-1-reasoning,or if((x)k+1,(x)Fk)■((x)k,(x)Fk+1),then(αFk,αk+1)■(αFk+1,αk) is P-1-reasoning.P-1-reasoning is the dual form of P-reasoning.Internal P-1-reasoning is the dual form of internal P-reasoning.Outer P-1-reasoning is the dual form of outer P-reasoning.P-1-reasoning will be restored into general reasoning if a certain condition is satisfied.P-1-reasoning is got from inverse problem of P-1-reasoning.Internal P-1-reasoning,outer P-1-reasoning and their structure were given.P-1-reasoning structure and P-1-reasoning theorem were got.The relation of P-1-reasoning and general P-1-reasoning was given.The attribution resi-dual generated by P-1-reasoning was given.Using the studies,the application in information system was given.P-1-reasoning and P-reasoning are two type of dynamic reasoning forms generated by P-sets,which are applied in different area of information system.