default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYin Chen 0005
Person information
- affiliation: South China Normal University, Department of Computer Science, Guangdong, China
- affiliation: Sun Yat-Sen University, Software Institute, Guangzhou, China
Other persons with the same name
- Yin Chen — disambiguation page
- Yin Chen 0001
![[0000-0002-2652-8941]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2652-8941")
— Reitaku University, Japan (and 3 more) - Yin Chen 0002 — Qualcomm Research Silicon Valley, Santa Clara, CA, USA (and 1 more)
- Yin Chen 0003 — Army Engineering University of PLA, College of Defense Engineering, China (and 1 more)
- Yin Chen 0004 — EGI Foundation, Amsterdam, Netherlands
- Yin Chen 0006 — University of Strathclyde, Department of Electronic and Electrical Engineering, Glasgow, UK (and 2 more)
- Yin Chen 0007 — Chongqing University, Business and Administration College, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c9]Weilin Luo, Hai Wan, Xiaotong Song, Binhao Yang, Hongzhen Zhong, Yin Chen:
How to Identify Boundary Conditions with Contrasty Metric? ICSE 2021: 1473-1484- [i3]Weilin Luo, Hai Wan, Xiaotong Song, Binhao Yang, Hongzhen Zhong, Yin Chen:
How to Identify Boundary Conditions with Contrasty Metric? CoRR abs/2103.02384 (2021)
2010 – 2019
- 2015
- [j3]Vernon Asuncion, Yin Chen, Yan Zhang, Yi Zhou:
Ordered completion for logic programs with aggregates. Artif. Intell. 224: 72-102 (2015) - 2011
- [j2]Yin Chen, Fangzhen Lin, Yan Zhang, Yi Zhou:
Loop-separable programs and their first-order definability. Artif. Intell. 175(3-4): 890-913 (2011) - [i2]Yin Chen, Fangzhen Lin:
Discovering Classes of Strongly Equivalent Logic Programs. CoRR abs/1110.2738 (2011) - 2010
- [c8]Yin Chen, Yan Zhang, Yi Zhou:
First-Order Indefinability of Answer Set Programs on Finite Structures. AAAI 2010: 285-290 - [c7]Yin Chen, Hai Wan, Yan Zhang, Yi Zhou:
dl2asp: Implementing Default Logic via Answer Set Programming. JELIA 2010: 104-116
2000 – 2009
- 2007
- [j1]Fangzhen Lin, Yin Chen:
Discovering Classes of Strongly Equivalent Logic Programs. J. Artif. Intell. Res. 28: 431-451 (2007) - [i1]Abhaya C. Nayak, Yin Chen, Fangzhen Lin:
Forgetting and Update -- an exploration. Formal Models of Belief Change in Rational Agents 2007 - 2006
- [c6]Abhaya C. Nayak, Yin Chen, Fangzhen Lin:
Forgetting and Knowledge Update. Australian Conference on Artificial Intelligence 2006: 131-140 - [c5]Hai Wan, Yunxiang Zheng, Yin Chen, Lei Li:
Building Business Process Description and Reasoning Meta-model Mbp in A-Prolog. SPW/ProSim 2006: 195-203 - [c4]Yin Chen, Fangzhen Lin, Yisong Wang, Mingyi Zhang:
First-Order Loop Formulas for Normal Logic Programs. KR 2006: 298-307 - 2005
- [c3]Yin Chen, Fangzhen Lin, Lei Li:
SELP - A System for Studying Strong Equivalence between Logic Programs. Answer Set Programming 2005 - [c2]Fangzhen Lin, Yin Chen:
Discovering Classes of Strongly Equivalent Logic Programs. IJCAI 2005: 516-521 - [c1]Yin Chen, Fangzhen Lin, Lei Li:
SELP - A System for Studying Strong Equivalence Between Logic Programs. LPNMR 2005: 442-446
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 2024-12-23 20:29 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:
