The distribution of the generic recursively enumerable degrees. - Decheng Ding (Arch. Math. Log., 1992)

Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees. - Decheng Ding; Klaus Ambos-Spies (Math. Log. Q., 1994)

Isolated d.r.e. degrees are dense in r.e. degree structure. - Decheng Ding; Lei Qian (Arch. Math. Log., 1996)

A Three-Valued Quantificational Logic of Context. - Kaile Su; Decheng Ding; Huowang Chen (COCOON, 1997)

Complexity Results for Restricted Credulous Default Reasoning. - Xishun Zhao; Decheng Ding; Hans Kleine Büning (AI Commun., 2000)

Two alternative notions of 'possibility' satisfying Halpern's conditions. - Kaile Su; Huowang Chen; Decheng Ding (J. Log. Comput., 2000)

A Splitting with Infimum in the d-c. e. Degrees. - Lu Hong; Decheng Ding; Lei Qian (Math. Log. Q., 2000)

Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. - Xishun Zhao; Decheng Ding (Fundam. Informaticae, 2001)

Complexity Results for 2CNF Default Theories. - Xishun Zhao; Decheng Ding (Fundam. Informaticae, 2001)

FC-normal and extended stratified logic program. - Daoyun Xu; Decheng Ding (Sci. China Ser. F Inf. Sci., 2002)

An extension of Harrington's noncupping theorem. - Liang Yu 004; Decheng Ding (Sci. China Ser. F Inf. Sci., 2003)

Characterization of an Auto-Compatible Default Theory. - Daoyun Xu; Decheng Ding; Mingyi Zhang 002 (J. Comput. Sci. Technol., 2003)

Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. - Xishun Zhao; Decheng Ding (J. Comput. Sci. Technol., 2003)

The Kolmogorov complexity of random reals. - Liang Yu 004; Decheng Ding; Rodney G. Downey (Ann. Pure Appl. Log., 2004)

There is no SW-complete c.e. real. - Decheng Ding; Liang Yu 004 (J. Symb. Log., 2004)

Automatic abstraction refinement for Petri nets verification. - Zhenyu Chen 001; Conghua Zhou; Decheng Ding (HLDVT, 2005)

Computability of measurable sets via effective metrics. - Yongcheng Wu; Decheng Ding (Math. Log. Q., 2005)

Variable Minimal Unsatisfiability. - Zhenyu Chen 001; Decheng Ding (TAMC, 2006)

Improved SAT Based Bounded Model Checking. - Conghua Zhou; Decheng Ding (TAMC, 2006)

Computability of measurable sets via effective topologies. - Yongcheng Wu; Decheng Ding (Arch. Math. Log., 2006)

Absolutely Non-effective Predicates and Functions in Computable Analysis. - Decheng Ding; Klaus Weihrauch; Yongcheng Wu (TAMC, 2007)

On the definable ideal generated by the plus cupping c.e. degrees. - Wei Wang 345; Decheng Ding (Arch. Math. Log., 2007)

On definable filters in computably enumerable degrees. - Wei Wang 345; Decheng Ding (Ann. Pure Appl. Log., 2007)

Bounding non-GL2 and R.E.A. - Klaus Ambos-Spies; Decheng Ding; Wei Wang 345; Liang Yu 004 (J. Symb. Log., 2009)

Absolutely non-computable predicates and functions in analysis. - Klaus Weihrauch; Yongcheng Wu; Decheng Ding (Math. Struct. Comput. Sci., 2009)

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees. - Klaus Ambos-Spies; Decheng Ding; Yun Fan; Wolfgang Merkle (Theory Comput. Syst., 2013)