default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDecheng Ding
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j21]Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle:
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees. Theory Comput. Syst. 52(1): 2-27 (2013)
2000 – 2009
- 2009
- [j20]Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu:
Bounding non-GL2 and R.E.A. J. Symb. Log. 74(3): 989-1000 (2009) - [j19]Klaus Weihrauch, Yongcheng Wu, Decheng Ding:
Absolutely non-computable predicates and functions in analysis. Math. Struct. Comput. Sci. 19(1): 59-71 (2009) - 2007
- [j18]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) - [j17]Wei Wang, Decheng Ding:
On definable filters in computably enumerable degrees. Ann. Pure Appl. Log. 147(1-2): 71-83 (2007) - [c5]Decheng Ding, Klaus Weihrauch, Yongcheng Wu:
Absolutely Non-effective Predicates and Functions in Computable Analysis. TAMC 2007: 595-604 - 2006
- [j16]Yongcheng Wu, Decheng Ding:
Computability of measurable sets via effective topologies. Arch. Math. Log. 45(3): 365-379 (2006) - [c4]Zhenyu Chen, Decheng Ding:
Variable Minimal Unsatisfiability. TAMC 2006: 262-273 - [c3]Conghua Zhou, Decheng Ding:
Improved SAT Based Bounded Model Checking. TAMC 2006: 611-620 - 2005
- [j15]Yongcheng Wu, Decheng Ding:
Computability of measurable sets via effective metrics. Math. Log. Q. 51(6): 543-559 (2005) - [c2]Zhenyu Chen, Conghua Zhou, Decheng Ding:
Automatic abstraction refinement for Petri nets verification. HLDVT 2005: 168-174 - 2004
- [j14]Liang Yu, Decheng Ding, Rodney G. Downey:
The Kolmogorov complexity of random reals. Ann. Pure Appl. Log. 129(1-3): 163-180 (2004) - [j13]Decheng Ding, Liang Yu:
There is no SW-complete c.e. real. J. Symb. Log. 69(4): 1163-1170 (2004) - 2003
- [j12]Liang Yu, Decheng Ding:
An extension of Harrington's noncupping theorem. Sci. China Ser. F Inf. Sci. 46(3): 199-209 (2003) - [j11]Xishun Zhao, Decheng Ding:
Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. J. Comput. Sci. Technol. 18(1): 118-124 (2003) - [j10]Daoyun Xu, Decheng Ding, Mingyi Zhang:
Characterization of an Auto-Compatible Default Theory. J. Comput. Sci. Technol. 18(3): 393-398 (2003) - 2002
- [j9]Daoyun Xu, Decheng Ding:
FC-normal and extended stratified logic program. Sci. China Ser. F Inf. Sci. 45(4): 259-272 (2002) - 2001
- [j8]Xishun Zhao, Decheng Ding:
Complexity Results for 2CNF Default Theories. Fundam. Informaticae 45(4): 393-404 (2001) - [j7]Xishun Zhao, Decheng Ding:
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. Fundam. Informaticae 48(1): 93-106 (2001) - 2000
- [j6]Xishun Zhao, Decheng Ding, Hans Kleine Büning:
Complexity Results for Restricted Credulous Default Reasoning. AI Commun. 13(4): 249-258 (2000) - [j5]Kaile Su
, Huowang Chen, Decheng Ding:
Two alternative notions of 'possibility' satisfying Halpern's conditions. J. Log. Comput. 10(2): 253-269 (2000) - [j4]Lu Hong, Decheng Ding, Lei Qian:
A Splitting with Infimum in the d-c. e. Degrees. Math. Log. Q. 46(1): 53-76 (2000)
1990 – 1999
- 1997
- [c1]Kaile Su, Decheng Ding, Huowang Chen:
A Three-Valued Quantificational Logic of Context. COCOON 1997: 343-352 - 1996
- [j3]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
- [j2]Decheng Ding, Klaus Ambos-Spies:
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees. Math. Log. Q. 40: 287-317 (1994) - 1992
- [j1]Decheng Ding:
The distribution of the generic recursively enumerable degrees. Arch. Math. Log. 32(2): 113-135 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
