Xingxing He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xingxing He has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Jun Liu
Ulster University
4 shared publications Keyun Qin
Department of Mathematics, Southwest Jiaotong University, Chengdu, Sichuan, PR China
3 shared publications- Yang Xu
Southwest Jiaotong University
3 shared publications Yingfang Li
School of Economics Information Engineering, Southwestern University of Finance and Economics, Chengdu, Sichuan, PR China
3 shared publications- Da Ruan
Hasselt University
2 shared publications Yang Xu
Southwest Jiaotong University
2 shared publications
Latest Publications
- 23 June 2015
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 28 (5) , 2113-2125
Similarity measures of interval-valued fuzzysets
Interval-valued fuzzy set (briefly, IVFS) is a generalization of fuzzy set that may better model imperfect information. Similarity measure is a useful tool for determining the similarity degree between two fuzzy concepts. In this paper, the definition of similarity measure of IVFSs is presented. Three approaches to constructing similarity measures of IVFSs are proposed. Based on the approaches, three computation formulae for calculating the similarity degree between IVFSs are obtained. The properties of similarity measures of IVFSs are examined as a whole.
- 23 June 2015
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 28 (5) , 2113-2125
Similarity measures of interval-valued fuzzysets
Interval-valued fuzzy set (briefly, IVFS) is a generalization of fuzzy set that may better model imperfect information. Similarity measure is a useful tool for determining the similarity degree between two fuzzy concepts. In this paper, the definition of similarity measure of IVFSs is presented. Three approaches to constructing similarity measures of IVFSs are proposed. Based on the approaches, three computation formulae for calculating the similarity degree between IVFSs are obtained. The properties of similarity measures of IVFSs are examined as a whole.
- 20 June 2014
- Published by Springer Nature
- p. 35-42
Comparisons Among α-Generalized Resolution Methods in $\fancyscript{L}_{n \times 2}$F(X)- 20 June 2014
- Published by Springer Nature
- p. 35-42
Comparisons Among α-Generalized Resolution Methods in $\fancyscript{L}_{n \times 2}$F(X)- 1 August 2013
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 225, 93-105
Robustness of fuzzy connectives and fuzzy reasoning
- 1 August 2013
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 225, 93-105
Robustness of fuzzy connectives and fuzzy reasoning
- 24 July 2013
- Published by Springer Nature
- p. 377-384
$\alpha $-Generalized Lock Resolution with Deleting Strategies in $\fancyscript{L}_n$F(X)- 24 July 2013
- Published by Springer Nature
- p. 377-384
$\alpha $-Generalized Lock Resolution with Deleting Strategies in $\fancyscript{L}_n$F(X)- 1 January 2013
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 25 (1) , 1-7
On the associative property of fuzzy Xor connectives
The connective fuzzy Xor has been studied by Bedregal et al. [B.C. Bedregal, R.H.S. Reiser and G.P. Dimuro, Xor-Implications and E-Implications: Classes of fuzzy implications based on fuzzy Xor, Electronic Notes in Theoretical Computer Science 247 (2009) 5–18] and two methods for constructing fuzzy Xor are given. As an important property of classical Xor connective, associativity is also defined in the definition of fuzzy Xor. However, we find that some of the fuzzy Xor connectives constructed with the given methods do not satisfy associative property. This paper studies the conditions under which the fuzzy Xor constructed with the methods given in [1] satisfy associative property.
- 1 January 2013
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 25 (1) , 1-7
On the associative property of fuzzy Xor connectives
The connective fuzzy Xor has been studied by Bedregal et al. [B.C. Bedregal, R.H.S. Reiser and G.P. Dimuro, Xor-Implications and E-Implications: Classes of fuzzy implications based on fuzzy Xor, Electronic Notes in Theoretical Computer Science 247 (2009) 5–18] and two methods for constructing fuzzy Xor are given. As an important property of classical Xor connective, associativity is also defined in the definition of fuzzy Xor. However, we find that some of the fuzzy Xor connectives constructed with the given methods do not satisfy associative property. This paper studies the conditions under which the fuzzy Xor constructed with the methods given in [1] satisfy associative property.
- 19 November 2011
- Published by Springer Nature in Soft Computing
- Vol. 16 (4) , 699-709
On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
- 19 November 2011
- Published by Springer Nature in Soft Computing
- Vol. 16 (4) , 699-709
On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
- 31 October 2011
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 24 (7) , 1274-1280
α-Lock resolution method for a lattice-valued first-order logic
- 31 October 2011
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 24 (7) , 1274-1280
α-Lock resolution method for a lattice-valued first-order logic
- 11 February 2011
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 20 (3) , 579-588
On -satisfiability and its -lock resolution in a finite lattice-valued propositional logic
Automated reasoning issues are addressed for a finite lattice-valued propositional logic LnP(X) with truth-values in a finite lattice-valued logical algebraic structure—lattice implication algebra. We investigate extended strategies and rules from classical logic to LnP(X) to simplify the procedure in the semantic level for testing the satisfiability of formulas in LnP(X) at a certain truth-value level α (α-satisfiability) while keeping the role of truth constant formula played in LnP(X). We propose a lock resolution method at a certain truth-value level α (α-lock resolution) in LnP(X) and have proved its theorems of soundness and weak completeness, respectively. We provide more efficient resolution based automated reasoning in LnP(X) and key supports for α-resolution-based automated reasoning approaches and algorithms in lattice based linguistic truth-valued logic.
- 11 February 2011
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 20 (3) , 579-588
On -satisfiability and its -lock resolution in a finite lattice-valued propositional logic
Automated reasoning issues are addressed for a finite lattice-valued propositional logic LnP(X) with truth-values in a finite lattice-valued logical algebraic structure—lattice implication algebra. We investigate extended strategies and rules from classical logic to LnP(X) to simplify the procedure in the semantic level for testing the satisfiability of formulas in LnP(X) at a certain truth-value level α (α-satisfiability) while keeping the role of truth constant formula played in LnP(X). We propose a lock resolution method at a certain truth-value level α (α-lock resolution) in LnP(X) and have proved its theorems of soundness and weak completeness, respectively. We provide more efficient resolution based automated reasoning in LnP(X) and key supports for α-resolution-based automated reasoning approaches and algorithms in lattice based linguistic truth-valued logic.