许文艳
个人信息:Personal Information
副教授 研究生导师
性别:女
毕业院校:西安电子科技大学
学历:博士研究生毕业
学位:理学博士学位
在职信息:在岗
所在单位:数学与统计学院
入职时间:2004-07-01
学科:应用数学
电子邮箱:
扫描关注
- [1]Sequential rough set: a conservative extension of Pawlak’s classical rough set.Artificial Intelligence Review.2024,58 (9)
- [2]Three-way decision with ranking and reference tuple on information tables.Information Sciences.2022,613 :682-716
- [3]A two-universe model of three-way decision with ranking and reference tuple.INFORMATION SCIENCES.2021,581 :808-839
- [4]A generalized model of three-way decision with ranking and reference tuple.INTERNATIONAL JOURNAL OF APPROXIMATE REASONING.2022,144 :51-68
- [5]Three-way conflict analysis with similarity degree on an issue set.INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS.2023
- [6]Extended IF逻辑的命题演算系统.软件学报.2015,26 (9):2278-2285
- [7]A formal system for propositional extended IF logic.Ruan Jian Xue Bao/Journal of Software.2015,26 (9):2278-2285
- [8]The Parallel Versus Branching Recurrences In Computability Logic.Notre Dame Journal Of Formal Logic.2013,54 (1):61-78
- [9]A cirquent calculus system with clustering and ranking.JOURNAL OF APPLIED LOGIC.2016,16 :37-49
- [10]A Propositional System Induced By Japaridze\'s Approach To If Logic.Logic Journal Of The Igpl.2014,22 (6):982-991
- [11]Soundness and completeness of the cirquent calculus system CL6 for computability logic.Logic Journal of the IGPL,2012,20 (1):317-330
- [12]动直线轨迹方程的消参法在几何教学中的设计与探究.高等数学研究.2022,25 (4):108-110
- [13]幂级数的启发式教学设计与探究.教育进展.2023 (7):4225-4229
- [14]可计算性逻辑中若干形式系统及算子的研究.西安电子科技大学.2013 (4)
- [15]The Countable Versus Uncountable Branching Recurrences In Computability Logic.Journal Of Applied Logic.2012,10 (4):431-446
- [16]Deduction Theorem For Symmetric Cirquent Calculus.Quantitative Logic And Soft Computing 2010, Vol 2.2010,82 :121-126
- [17]任务逻辑中的定理.模糊系统与数学.2006,20 (6):15-20
- [18]命题逻辑公式的压缩表示及其相应的形式系统.模糊系统与数学.2011,25 (1):25-31
- [19]A Cirquent Calculus System With Clustering And Ranking.Journal Of Applied Logic.2016,16 :37-49
- [20]知识库系统的逻辑基础.计算机学报.2009,32 (11):2123-2129