Shaobo Deng

Shaobo Deng

Auto-generated profile, based on publicly available information

Shaobo Deng

Nanchang Institute of Technology

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 February 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
SDShaobo Deng
Shaobo Deng
HLHangyu Liu
Hangyu Liu
WZWeihu Zhu
Weihu Zhu
KLKexing Li
Kexing Li
MLMin Li
Min Li

7 July 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
HLHangyu Liu
Hangyu Liu
SDShaobo Deng
Shaobo Deng
KLKexing Li
Kexing Li
HSHui Shi
Hui Shi
MLMin Li
Min Li

1 January 2005
Verified
Conference Paper
Closed access
SDShaobo Deng
Shaobo Deng
RRRoger Ruan
Roger Ruan
CMChul Kyoon Mok
Chul Kyoon Mok
Guangwei HuangGuangwei Huang
Guangwei Huang
PCPaul L. Chen
Paul L. Chen

12 November 2021 in International Journal of Intelligent Systems
Verified
Journal Article
Open access
PDF file
SDShaobo Deng
Shaobo Deng
SGSujie Guan
Sujie Guan
HWHui Wang
Hui Wang
ZHZhikai Huang
Zhikai Huang
MLMin Li
Min Li
Formalization of rough sets is a key issue in rough set theory. When rough sets are formalized by propositional logic, predicate logic, or modal propositional logic, it easily suffers from some problems. For instance, an incomplete system is obtained. The concepts of “ p r e c i s e” or “ r o u g h” of rough sets cannot be described. To tackle these issues, a new noncontingency axiomatic system is proposed for formalizing rough sets in this paper. First, a new concise accessibility relation is defined for the axiomatic system; then, two simpler axiom schemas of the axiomatic system are designed to replace the axiom schema K. This is helpful to prove the soundness and completeness theorems for the axiomatic system. Finally, rough sets can be perfectly formalized by our proposed axiomatic system. Theoretical analysis proves that a complete formal system is achieved. In addition, the concepts of “ p r e c i s e” or “ r o u g h” of rough sets can be described without the help of semantics functions of metalanguage.

1 January 2006
Verified
Conference Paper
Closed access
PDF file
FYFei Yu
Fei Yu
RRRoger Ruan
Roger Ruan
SDShaobo Deng
Shaobo Deng
PCPaul L. Chen
Paul L. Chen
XLXiangyang Lin
Xiangyang Lin

1 January 2023
Verified
Conference Paper
Closed access
PDF file
CRCeliannie Rivera
Celiannie Rivera
ANAlia Nasir
Alia Nasir
RARobinson Ndeddy Aka
Robinson Ndeddy Aka
SDShaobo Deng
Shaobo Deng
SWSarah X Wu
Sarah X Wu