| Discovering classes of strongly equivalent logic programs F Lin, Y Chen Journal of Artificial Intelligence Research 28, 431-451, 2007 | 55 | 2007 |
| First-Order Loop Formulas for Normal Logic Programs. Y Chen, F Lin, Y Wang, M Zhang KR 6, 298-307, 2006 | 33 | 2006 |
| SELP–a system for studying strong equivalence between logic programs Y Chen, F Lin, L Li Logic Programming and Nonmonotonic Reasoning: 8th International Conference …, 2005 | 24 | 2005 |
| dl2asp: Implementing default logic via answer set programming Y Chen, H Wan, Y Zhang, Y Zhou European Workshop on Logics in Artificial Intelligence, 104-116, 2010 | 18 | 2010 |
| Ordered completion for logic programs with aggregates V Asuncion, Y Chen, Y Zhang, Y Zhou Artificial Intelligence 224, 72-102, 2015 | 17 | 2015 |
| Loop-separable programs and their first-order definability Y Chen, F Lin, Y Zhang, Y Zhou Artificial Intelligence 175 (3-4), 890-913, 2011 | 11 | 2011 |
| First-order indefinability of answer set programs on finite structures Y Chen, Y Zhang, Y Zhou Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 285-290, 2010 | 5 | 2010 |
| Some Negative Results on First-order Definability of Answer Set Programs Y Chen, Y Zhang, Y Zhou | | 2009 |
| A Game-theoretic Characterization on the First-order Indefinability of Answer Set Programs Y Zhang, Y Zhou, Y Chen | | |
