SELP - A System for Studying Strong Equivalence between Logic Programs. - Yin Chen 005; Fangzhen Lin; Lei Li 022 (Answer Set Programming, 2005)

Forgetting and Knowledge Update. - Abhaya C. Nayak; Yin Chen 005; Fangzhen Lin (Australian Conference on Artificial Intelligence, 2006)

Building Business Process Description and Reasoning Meta-model Mbp in A-Prolog. - Hai Wan; Yunxiang Zheng; Yin Chen 005; Lei Li 022 (SPW/ProSim, 2006)

First-Order Loop Formulas for Normal Logic Programs. - Yin Chen 005; Fangzhen Lin; Yisong Wang; Mingyi Zhang 002 (KR, 2006)

Forgetting and Update – an exploration. - Abhaya C. Nayak; Yin Chen 005; Fangzhen Lin (Formal Models of Belief Change in Rational Agents, 2007)

Discovering Classes of Strongly Equivalent Logic Programs. - Fangzhen Lin; Yin Chen 005 (J. Artif. Intell. Res., 2007)

First-Order Indefinability of Answer Set Programs on Finite Structures. - Yin Chen 005; Yan Zhang 003; Yi Zhou 013 (AAAI, 2010)

dl2asp: Implementing Default Logic via Answer Set Programming. - Yin Chen 005; Hai Wan; Yan Zhang 003; Yi Zhou 013 (JELIA, 2010)

Loop-separable programs and their first-order definability. - Yin Chen 005; Fangzhen Lin; Yan Zhang 003; Yi Zhou 013 (Artif. Intell., 2011)

Ordered completion for logic programs with aggregates. - Vernon Asuncion; Yin Chen 005; Yan Zhang 003; Yi Zhou 013 (Artif. Intell., 2015)

How to Identify Boundary Conditions with Contrasty Metric? - Weilin Luo; Hai Wan; Xiaotong Song; Binhao Yang; Hongzhen Zhong; Yin Chen 005 (ICSE, 2021)