Decomposition and reduction of packet set

摘要：

Packet set is a set pair which is composed of the Internal and outer packet set together. In this paper using the concepts and structures of packet set, we give several new concepts, such as decomposition class, reduction class, decomposition base, reduction base and so on. We further put forward decomposition and reduction theorem, the mzximal and minimal attribute set principles. Decomposition and reduction of packet set are the theoretical base in the research of reasoning in dynamic system.

关键词： packet set decomposition class reduction class decomposition theorem reduction theorem

作者: Ling Zhang Baokui Chen

作者单位: School of Mathematics and Computer Sciences Longyan University,Longyan 364000, P.R.China School of Mathematics and Computer Sciences Longyan University Longyan 364000, P.R.China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 303-306

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）