2009 |
19 | EE | Klaus Weihrauch,
Yongcheng Wu,
Decheng Ding:
Absolutely non-computable predicates and functions in analysis.
Mathematical Structures in Computer Science 19(1): 59-71 (2009) |
2007 |
18 | EE | Decheng Ding,
Klaus Weihrauch,
Yongcheng Wu:
Absolutely Non-effective Predicates and Functions in Computable Analysis.
TAMC 2007: 595-604 |
17 | EE | Wei Wang,
Decheng Ding:
On definable filters in computably enumerable degrees.
Ann. Pure Appl. Logic 147(1-2): 71-83 (2007) |
16 | EE | Wei Wang,
Decheng Ding:
On the definable ideal generated by the plus cupping c.e. degrees.
Arch. Math. Log. 46(3-4): 321-346 (2007) |
2006 |
15 | EE | Zhenyu Chen,
Decheng Ding:
Variable Minimal Unsatisfiability.
TAMC 2006: 262-273 |
14 | EE | Conghua Zhou,
Decheng Ding:
Improved SAT Based Bounded Model Checking.
TAMC 2006: 611-620 |
13 | EE | Yongcheng Wu,
Decheng Ding:
Computability of measurable sets via effective topologies.
Arch. Math. Log. 45(3): 365-379 (2006) |
2005 |
12 | EE | Yongcheng Wu,
Decheng Ding:
Computability of measurable sets via effective metrics.
Math. Log. Q. 51(6): 543-559 (2005) |
2004 |
11 | EE | Liang Yu,
Decheng Ding,
Rodney G. Downey:
The Kolmogorov complexity of random reals.
Ann. Pure Appl. Logic 129(1-3): 163-180 (2004) |
2003 |
10 | EE | Xishun Zhao,
Decheng Ding:
Fixed-Parameter Tractability of Disjunction-Free Default Reasoning.
J. Comput. Sci. Technol. 18(1): 118-124 (2003) |
9 | EE | Daoyun Xu,
Decheng Ding,
Zhang Mingyi:
Characterization of an Auto-Compatible Default Theory.
J. Comput. Sci. Technol. 18(3): 393-398 (2003) |
2001 |
8 | | Xishun Zhao,
Decheng Ding:
Complexity Results for 2CNF Default Theories.
Fundam. Inform. 45(4): 393-404 (2001) |
7 | | Xishun Zhao,
Decheng Ding:
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems.
Fundam. Inform. 48(1): 93-106 (2001) |
2000 |
6 | | Xishun Zhao,
Decheng Ding,
Hans Kleine Büning:
Complexity Results for Restricted Credulous Default Reasoning.
AI Commun. 13(4): 249-258 (2000) |
5 | | Kaile Su,
Huowang Chen,
Decheng Ding:
Two alternative notions of 'possibility' satisfying Halpern's conditions.
J. Log. Comput. 10(2): 253-269 (2000) |
4 | EE | Lu Hong,
Decheng Ding,
Lei Qian:
A Splitting with Infimum in the d-c. e. Degrees.
Math. Log. Q. 46(1): 53-76 (2000) |
1997 |
3 | | Kaile Su,
Decheng Ding,
Huowang Chen:
A Three-Valued Quantificational Logic of Context.
COCOON 1997: 343-352 |
1996 |
2 | EE | Decheng Ding,
Lei Qian:
Isolated d.r.e. degrees are dense in r.e. degree structure.
Arch. Math. Log. 36(1): 1-10 (1996) |
1994 |
1 | | Decheng Ding,
Klaus Ambos-Spies:
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.
Math. Log. Q. 40: 287-317 (1994) |