Decheng Ding

According to our database, Decheng Ding authored at least 26 papers between 1992 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees.

Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle

Theory Comput. Syst., 2013

2009

Absolutely non-computable predicates and functions in analysis.

Klaus Weihrauch, Yongcheng Wu, Decheng Ding

Math. Struct. Comput. Sci., 2009

Bounding non-GL₂ and R.E.A.

Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu

J. Symb. Log., 2009

2007

On definable filters in computably enumerable degrees.

Wei Wang, Decheng Ding

Ann. Pure Appl. Log., 2007

On the definable ideal generated by the plus cupping c.e. degrees.

Wei Wang, Decheng Ding

Arch. Math. Log., 2007

Absolutely Non-effective Predicates and Functions in Computable Analysis.

Decheng Ding, Klaus Weihrauch, Yongcheng Wu

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

Computability of measurable sets via effective topologies.

Yongcheng Wu, Decheng Ding

Arch. Math. Log., 2006

Improved SAT Based Bounded Model Checking.

Conghua Zhou, Decheng Ding

Proceedings of the Theory and Applications of Models of Computation, 2006

Variable Minimal Unsatisfiability.

Zhenyu Chen, Decheng Ding

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Computability of measurable sets via effective metrics.

Yongcheng Wu, Decheng Ding

Math. Log. Q., 2005

Automatic abstraction refinement for Petri nets verification.

Zhenyu Chen, Conghua Zhou, Decheng Ding

Proceedings of the Tenth IEEE International High-Level Design Validation and Test Workshop 2005, Napa Valley, CA, USA, November 30, 2005

2004

There is no <i>SW</i>-complete c.e. real.

Decheng Ding, Liang Yu

J. Symb. Log., 2004

The Kolmogorov complexity of random reals.

Liang Yu, Decheng Ding, Rodney G. Downey

Ann. Pure Appl. Log., 2004

2003

Fixed-Parameter Tractability of Disjunction-Free Default Reasoning.

Xishun Zhao, Decheng Ding

J. Comput. Sci. Technol., 2003

Characterization of an Auto-Compatible Default Theory.

Daoyun Xu, Decheng Ding, Mingyi Zhang

J. Comput. Sci. Technol., 2003

An extension of Harrington's noncupping theorem.

Liang Yu, Decheng Ding

Sci. China Ser. F Inf. Sci., 2003

2002

<i>FC</i>-normal and extended stratified logic program.

Daoyun Xu, Decheng Ding

Sci. China Ser. F Inf. Sci., 2002

2001

Complexity Results for 2CNF Default Theories.

Xishun Zhao, Decheng Ding

Fundam. Informaticae, 2001

Some Algorithms for Extension Computation of Nonmonotonic Rule Systems.

Xishun Zhao, Decheng Ding

Fundam. Informaticae, 2001

2000

A Splitting with Infimum in the d-c. e. Degrees.

Lu Hong, Decheng Ding, Lei Qian

Math. Log. Q., 2000

Two alternative notions of 'possibility' satisfying Halpern's conditions.

Kaile Su, Huowang Chen, Decheng Ding

J. Log. Comput., 2000

Complexity Results for Restricted Credulous Default Reasoning.

Xishun Zhao, Decheng Ding, Hans Kleine Büning

AI Commun., 2000

1997

A Three-Valued Quantificational Logic of Context.

Kaile Su, Decheng Ding, Huowang Chen

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Isolated d.r.e. degrees are dense in r.e. degree structure.

Decheng Ding, Lei Qian

Arch. Math. Log., 1996

1994

Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.

Decheng Ding, Klaus Ambos-Spies

Math. Log. Q., 1994

1992

The distribution of the generic recursively enumerable degrees.

Decheng Ding

Arch. Math. Log., 1992