Yang Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yang Xu has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Jun Liu
Ulster University
11 shared publications - Da Ruan
Hasselt University
6 shared publications Shuwei Chen
School of Mathematics, Southwest Jiaotong University, Chengdu, China
3 shared publications- Xingxing He
Southwest Jiaotong University
3 shared publications Jun Liu
Ulster Univ, Sch Comp, Coleraine, Londonderry, North Ireland
2 shared publications- Luis Martínez
University of Jaén
2 shared publications
Latest Publications
- Open Access
- 31 March 2025
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 18 (1) , 1-18
Instance Assignment Coverage Feature for Operation Control of SAT Solver
- 31 March 2025
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 18 (1) , 1-18
Open AccessInstance Assignment Coverage Feature for Operation Control of SAT Solver
- Open Access
- 21 March 2024
- Published by Springer Nature in Research Square
CSE - A Automated Theorem Prover Based on Standard Contradiction Separation Dynamic Deduction
Contradiction Separation Extension (CSE in short), an automated theorem prover for first-order logic without equality, which is based on a novel standard contradiction separation (S-CS) inference rule. Different from binary resolution or its refinements, the biggest difference and characteristic of S-CS rule is that each resolution step can handle multiple (two or more) clauses for synergized deduction. This paper mainly describes problem format conversion, clause set preprocessing, deduction framework, distinctive heuristic strategies, S-CS dynamic inference mechanism in CSE. CSE is evaluated through benchmarks and the deduction characteristics of this multi-clause dynamic deduction are demonstrated, e.g., FOF division problems of CASC-26, CASC-J9. In addition, the CASC-J9 is also tested by combined systems, which combine CSE and other prover (Prover9, Eprover, Vampire), and the combined systems is applied to test on the hard problems with rating of 1. Experimental results show the CSE shows a competitive performance and can play a role in first-order logic automated theorem proving.
- 21 March 2024
- Published by Springer Nature in Research Square
Open AccessCSE - A Automated Theorem Prover Based on Standard Contradiction Separation Dynamic Deduction
Contradiction Separation Extension (CSE in short), an automated theorem prover for first-order logic without equality, which is based on a novel standard contradiction separation (S-CS) inference rule. Different from binary resolution or its refinements, the biggest difference and characteristic of S-CS rule is that each resolution step can handle multiple (two or more) clauses for synergized deduction. This paper mainly describes problem format conversion, clause set preprocessing, deduction framework, distinctive heuristic strategies, S-CS dynamic inference mechanism in CSE. CSE is evaluated through benchmarks and the deduction characteristics of this multi-clause dynamic deduction are demonstrated, e.g., FOF division problems of CASC-26, CASC-J9. In addition, the CASC-J9 is also tested by combined systems, which combine CSE and other prover (Prover9, Eprover, Vampire), and the combined systems is applied to test on the hard problems with rating of 1. Experimental results show the CSE shows a competitive performance and can play a role in first-order logic automated theorem proving.
- 1 August 2021
- Published by Elsevier in Information Sciences
- Vol. 566, 118-139
Emphasis on the flipping variable: Towards effective local search for hard random satisfiability
- 1 August 2021
- Published by Elsevier in Information Sciences
- Vol. 566, 118-139
Emphasis on the flipping variable: Towards effective local search for hard random satisfiability
- Open Access
An Adaptive Strategy for Tuning Duplicate Trails in SAT Solvers
In mainstream conflict driven clause learning (CDCL) solvers, because of frequent restarts and phase saving, there exists a large proportion of duplicate assignment trails before and after restarts, resulting in unnecessary time wastage during solving. This paper proposes a new strategy—identifying those duplicate assignments trails and dealing with them by changing the sort order. This approach’s performance is compared with that of the Luby static restart scheme and a dynamic Glucose-restart strategy. We show that the number of solved instances is increased by 3.2% and 4.6%. We also make a compassion with the MapleCOMSPS solver by testing against application benchmarks from the SAT Competitions 2015 to 2017. These empirical results provide further evidence of the benefits of the proposed heuristic, having the advantage of managing duplicate assignments trails and choosing appropriate decision variables adaptively.
Open AccessAn Adaptive Strategy for Tuning Duplicate Trails in SAT Solvers
In mainstream conflict driven clause learning (CDCL) solvers, because of frequent restarts and phase saving, there exists a large proportion of duplicate assignment trails before and after restarts, resulting in unnecessary time wastage during solving. This paper proposes a new strategy—identifying those duplicate assignments trails and dealing with them by changing the sort order. This approach’s performance is compared with that of the Luby static restart scheme and a dynamic Glucose-restart strategy. We show that the number of solved instances is increased by 3.2% and 4.6%. We also make a compassion with the MapleCOMSPS solver by testing against application benchmarks from the SAT Competitions 2015 to 2017. These empirical results provide further evidence of the benefits of the proposed heuristic, having the advantage of managing duplicate assignments trails and choosing appropriate decision variables adaptively.
- Open Access
- 1 January 2017
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 10 (1) , 824-834
A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems
- 1 January 2017
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 10 (1) , 824-834
Open AccessA Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems
- Open Access
- 1 January 2015
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 8 (Supplement) , 75-84
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic system ℒ P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit lattice-valued Horn...
- 1 January 2015
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 8 (Supplement) , 75-84
Open Accessα-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic system ℒ P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit lattice-valued Horn...
- Open Access
- 1 January 2015
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 8 (Supplement) , 39-47
GA-Based Feature Selection Method for Imbalanced Data with Application in Radio Signal Recognition
This paper presents an improved genetic algorithm (GA) based feature selection method for imbalanced data classification, which is then applied to radio signal recognition of ground-air communication. The proposed method improves the fitness function while SVM is selected as the classifier due to its good classification performance. This method is firstly...
- 1 January 2015
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 8 (Supplement) , 39-47
Open AccessGA-Based Feature Selection Method for Imbalanced Data with Application in Radio Signal Recognition
This paper presents an improved genetic algorithm (GA) based feature selection method for imbalanced data classification, which is then applied to radio signal recognition of ground-air communication. The proposed method improves the fitness function while SVM is selected as the classifier due to its good classification performance. This method is firstly...
- Open Access
- 1 January 2015
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 8 (Supplement) , 48-62
A Method for Multi-attribute Decision Making Under Uncertainty Using Evidential Reasoning and Prospect Theory
In this paper, a method for multi-attribute decision making under uncertainty is proposed, the uncertainty is represented by certitude structure. In fact, there are both quantitative and qualitative attributes with different representation in multi-attribute decision making under uncertainty, so the certitude structure transformation method is the first...
- 1 January 2015
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 8 (Supplement) , 48-62
Open AccessA Method for Multi-attribute Decision Making Under Uncertainty Using Evidential Reasoning and Prospect Theory
In this paper, a method for multi-attribute decision making under uncertainty is proposed, the uncertainty is represented by certitude structure. In fact, there are both quantitative and qualitative attributes with different representation in multi-attribute decision making under uncertainty, so the certitude structure transformation method is the first...
- Open Access
- 1 January 2015
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 8 (5) , 819-828
Redefined soft relations and soft functions
Soft set theory, proposed by Molodtsov, has been regarded as an effective mathematical tool to deal with uncertainties. In this paper, the notion of soft relation is introduced which is a generalization of the notion of soft set relation, and some related properties are examined. Furthermore, the connections between soft relations and fuzzy sets are analyzed. It is shown that fuzzy relation and fuzzy soft set may be considered as special cases of soft relation.
- 1 January 2015
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 8 (5) , 819-828
Open AccessRedefined soft relations and soft functions
Soft set theory, proposed by Molodtsov, has been regarded as an effective mathematical tool to deal with uncertainties. In this paper, the notion of soft relation is introduced which is a generalization of the notion of soft set relation, and some related properties are examined. Furthermore, the connections between soft relations and fuzzy sets are analyzed. It is shown that fuzzy relation and fuzzy soft set may be considered as special cases of soft relation.
- 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)