Decheng Ding - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2013

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz DegreesKlaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle. mst, 52(1):2-27, 2013. [doi]

2009

Bounding non-GL::2:: and R.E.AKlaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu. JSYML, 74(3):989-1000, 2009. [doi]

Absolutely non-computable predicates and functions in analysisKlaus Weihrauch, Yongcheng Wu, Decheng Ding. mscs, 19(1):59-71, 2009. [doi]

2007

Absolutely Non-effective Predicates and Functions in Computable AnalysisDecheng Ding, Klaus Weihrauch, Yongcheng Wu. tamc 2007: 595-604 [doi]

On definable filters in computably enumerable degreesWei Wang, Decheng Ding. APAL, 147(1-2):71-83, 2007. [doi]

On the definable ideal generated by the plus cupping c.e. degreesWei Wang, Decheng Ding. AML, 46(3-4):321-346, 2007. [doi]

2006

Variable Minimal UnsatisfiabilityZhenyu Chen, Decheng Ding. tamc 2006: 262-273 [doi]

Computability of measurable sets via effective topologiesYongcheng Wu, Decheng Ding. AML, 45(3):365-379, 2006. [doi]

Improved SAT Based Bounded Model CheckingConghua Zhou, Decheng Ding. tamc 2006: 611-620 [doi]

2005

Automatic abstraction refinement for Petri nets verificationZhenyu Chen, Conghua Zhou, Decheng Ding. hldvt 2005: 168-174 [doi]

Computability of measurable sets via effective metricsYongcheng Wu, Decheng Ding. mlq, 51(6):543-559, 2005. [doi]

2004

There is no ::::SW::::-complete c.e. realDecheng Ding, Liang Yu. JSYML, 69(4):1163-1170, 2004. [doi]

The Kolmogorov complexity of random realsLiang Yu, Decheng Ding, Rodney G. Downey. APAL, 129(1-3):163-180, 2004. [doi]

2003

Characterization of an Auto-Compatible Default TheoryDaoyun Xu, Decheng Ding, Zhang Mingyi. jcst, 18(3):393-398, 2003. [doi]

An extension of Harrington s noncupping theoremLiang Yu, Decheng Ding. chinaf, 46(3):199-209, 2003. [doi]

Fixed-Parameter Tractability of Disjunction-Free Default ReasoningXishun Zhao, Decheng Ding. jcst, 18(1):118-124, 2003. [doi]

2002

FC-normal and extended stratified logic programDaoyun Xu, Decheng Ding. chinaf, 45(4):259-272, 2002. [doi]

2001

Complexity Results for 2CNF Default TheoriesXishun Zhao, Decheng Ding. FUIN, 45(4):393-404, 2001.

Some Algorithms for Extension Computation of Nonmonotonic Rule SystemsXishun Zhao, Decheng Ding. FUIN, 48(1):93-106, 2001.

2000

A Splitting with Infimum in the d-c. e. DegreesLu Hong, Decheng Ding, Lei Qian. mlq, 46(1):53-76, 2000. [doi]

Two alternative notions of possibility satisfying Halpern s conditionsKaile Su, Huowang Chen, Decheng Ding. logcom, 10(2):253-269, 2000.

Complexity Results for Restricted Credulous Default ReasoningXishun Zhao, Decheng Ding, Hans Kleine Büning. aicom, 13(4):249-258, 2000.

1997

A Three-Valued Quantificational Logic of ContextKaile Su, Decheng Ding, Huowang Chen. cocoon 1997: 343-352

1996

Isolated d.r.e. degrees are dense in r.e. degree structureDecheng Ding, Lei Qian. AML, 36(1):1-10, 1996. [doi]

1994

Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching DegreesDecheng Ding, Klaus Ambos-Spies. mlq, 40:287-317, 1994.

1992

The distribution of the generic recursively enumerable degreesDecheng Ding. AML, 32(2):113-135, 1992. [doi]

Sign in or sign up to see more results.

runs on WebDSL