Decheng Ding

25 papers C 3Misc 1Journal 20Unranked 1
YearRankTypeTitle / Venue / Authors
2013 J jnl
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees.
Theory Comput. Syst.
Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle
2009 J jnl
Absolutely non-computable predicates and functions in analysis.
Math. Struct. Comput. Sci.
Klaus Weihrauch, Yongcheng Wu, Decheng Ding
2009 J jnl
Bounding non-GL
J. Symb. Log.
Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu
2007 C conf
Absolutely Non-effective Predicates and Functions in Computable Analysis.
TAMC
Decheng Ding, Klaus Weihrauch, Yongcheng Wu
2007 J jnl
On definable filters in computably enumerable degrees.
Ann. Pure Appl. Log.
Wei Wang, Decheng Ding
2007 J jnl
On the definable ideal generated by the plus cupping c.e. degrees.
Arch. Math. Log.
Wei Wang, Decheng Ding
2006 J jnl
Computability of measurable sets via effective topologies.
Arch. Math. Log.
Yongcheng Wu, Decheng Ding
2006 C conf
Improved SAT Based Bounded Model Checking.
TAMC
Conghua Zhou, Decheng Ding
2006 C conf
Variable Minimal Unsatisfiability.
TAMC
Zhenyu Chen, Decheng Ding
2005 — conf
Automatic abstraction refinement for Petri nets verification.
HLDVT
Zhenyu Chen, Conghua Zhou, Decheng Ding
2005 J jnl
Computability of measurable sets via effective metrics.
Math. Log. Q.
Yongcheng Wu, Decheng Ding
2004 J jnl
The Kolmogorov complexity of random reals.
Ann. Pure Appl. Log.
Liang Yu, Decheng Ding, Rodney G. Downey
2004 J jnl
There is no
J. Symb. Log.
Decheng Ding, Liang Yu
2003 J jnl
An extension of Harrington's noncupping theorem.
Sci. China Ser. F Inf. Sci.
Liang Yu, Decheng Ding
2003 J jnl
Characterization of an Auto-Compatible Default Theory.
J. Comput. Sci. Technol.
Daoyun Xu, Decheng Ding, Mingyi Zhang
2003 J jnl
Fixed-Parameter Tractability of Disjunction-Free Default Reasoning.
J. Comput. Sci. Technol.
Xishun Zhao, Decheng Ding
2001 J jnl
Complexity Results for 2CNF Default Theories.
Fundam. Informaticae
Xishun Zhao, Decheng Ding
2001 J jnl
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems.
Fundam. Informaticae
Xishun Zhao, Decheng Ding
2000 J jnl
A Splitting with Infimum in the d-c. e. Degrees.
Math. Log. Q.
Lu Hong, Decheng Ding, Lei Qian
2000 J jnl
Complexity Results for Restricted Credulous Default Reasoning.
AI Commun.
Xishun Zhao, Decheng Ding, Hans Kleine Büning
2000 J jnl
Two alternative notions of 'possibility' satisfying Halpern's conditions.
J. Log. Comput.
Kaile Su, Huowang Chen, Decheng Ding
1997 Misc conf
A Three-Valued Quantificational Logic of Context.
COCOON
Kaile Su, Decheng Ding, Huowang Chen
1996 J jnl
Isolated d.r.e. degrees are dense in r.e. degree structure.
Arch. Math. Log.
Decheng Ding, Lei Qian
1994 J jnl
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.
Math. Log. Q.
Decheng Ding, Klaus Ambos-Spies
1992 J jnl
The distribution of the generic recursively enumerable degrees.
Arch. Math. Log.
Decheng Ding