#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2000

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Zixin Liu, Jian Yu, Daoyun Xu, Dingtao Peng
- Neurocomputing
- 2013

- Lin Pan, Daoyun Xu, Wuneng Zhou
- 2010

Abstract. In this paper, the linear feedback controlling of a novel chaotic system is discussed. The chaotic system is a new attractor which is similar to the Lorenz chaotic attractor, but it is not topological equivalent with the Lorenz chaotic system. This Letter proposes a novel approach for controlling this new attractor by linear feedback functions.… (More)

- Hans Kleine Büning, Daoyun Xu
- Annals of Mathematics and Artificial Intelligence
- 2005

We investigate the complexity of deciding whether for minimal unsatisfiable formulas F and H there exists a variable renaming, a literal renaming or a homomorphism ϕ such that ϕ(F) = H. A variable renaming is a permutation of variables. A literal renaming is a permutation of variables which additionally replaces some of the variables by its complements. A… (More)

- Yongbin Qin, Daoyun Xu
- 2010 2nd International Workshop on Intelligent…
- 2010

Web search engines have become one of the absolutely necessary tools for us in the use of the Internet. They are receiving keen appreciation from the broad masses of network users because of the ability of quick search and the navigation service. However, the current used search engines do not take the actual situation and actual need of users into account,… (More)

- Daoyun Xu, Zhi-Hong Tao
- Journal of Computer Science and Technology
- 2005

A homomorphism φ of logic programs from P to P′ is a function mapping Atoms(P) to Atoms(P′) and it preserves complements and program clause. For each definite program clause a ← a1, ..., a n ∈ P it implies that φ(a) ← φ(a1), ..., φ(a n ) is a program clauses of P′. A homomorphism φ is an isomorphism if φ is a bijection. In this paper, the complexity of the… (More)

- Daoyun Xu, Decheng Ding
- Science in China Series F: Information Sciences
- 2002

This paper investigates the consistency property ofFC-normal logic program and presents an equivalent deciding condition whether a logic programP is anFC-normal program. The deciding condition describes the characterizations ofFC-normal program. By the Petri-net presentation of a logic program, the characterizations of stratification ofFC-normal program are… (More)

- Qingshun Zhang, Daoyun Xu
- TAMC
- 2007

- Yongbin Qin, Daoyun Xu
- 2009 WRI World Congress on Computer Science and…
- 2009

A clause set is renamable Horn if the result replacing part propositional variable with its complement is a set of Horn clauses. The renamable Horn problem is solvable in linear time, but the maximum renamable Horn problem (MAX-RHS) is NP-hard. In this paper, we present transformations between clause sets and undirected graphs in polynomial time, such that… (More)

Restricted on the proof of unsatisfiability of unsatisfiable formulas, a modified DPLL — RSMLS algorithm is presented. The new algorithm has a symmetry rule (Literal renaming ) and three simplified rule ((1,*)-Resolution, Subformula, and Multiple ). As an example, RSMLS algorithm is applied for the proof of unsatisfiability of pigeon-hole formula . We show… (More)