| Paramodulation-based theorem proving J Hsiang, C Lynch, M Rusinowitch Handbook of automated reasoning 1, 371, 2001 | 493 | 2001 |
| Basic paramodulation L Bachmair, H Ganzinger, C Lynch, W Snyder Information and computation 121 (2), 172-192, 1995 | 208 | 1995 |
| Basic paramodulation and superposition L Bachmair, H Ganzinger, C Lynch, W Snyder Automated Deduction—CADE-11: 11th International Conference on Automated …, 1992 | 152 | 1992 |
| On deciding satisfiability by theorem proving with speculative inferences MP Bonacina, CA Lynch, L De Moura Journal of Automated Reasoning 47 (2), 161-189, 2011 | 54 | 2011 |
| On forward closure and the finite variant property C Bouchard, KA Gero, C Lynch, P Narendran Frontiers of Combining Systems: 9th International Symposium, FroCoS 2013 …, 2013 | 44 | 2013 |
| Automatic decidability C Lynch, B Morawska Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 7-16, 2002 | 44 | 2002 |
| Oriented equational logic programming is complete C Lynch Journal of Symbolic Computation 23 (1), 23-45, 1997 | 39 | 1997 |
| Goal directed strategies for paramodulation W Snyder, C Lynch Rewriting Techniques and Applications: 4th International Conference, RTA-91 …, 1991 | 38 | 1991 |
| Oriented equational logic programming is complete C Lynch Journal of Symbolic Computation 23 (1), 23-45, 1997 | 33 | 1997 |
| Basic syntactic mutation C Lynch, B Morawska Automated Deduction—CADE-18: 18th International Conference on Automated …, 2002 | 32 | 2002 |
| On Deciding Satisfiability by DPLL() and Unsound Theorem Proving MP Bonacina, C Lynch, L De Moura Automated Deduction–CADE-22: 22nd International Conference on Automated …, 2009 | 31 | 2009 |
| On the relative soundness of the free algebra model for public key encryption C Lynch, C Meadows Electronic Notes in Theoretical Computer Science 125 (1), 43-54, 2005 | 31 | 2005 |
| Mapping the active site topography of the NAD-malic enzyme via alanine-scanning site-directed mutagenesis WE Karsten, L Chooback, D Liu, CC Hwang, C Lynch, PF Cook Biochemistry 38 (32), 10527-10532, 1999 | 29 | 1999 |
| Protocol analysis in Maude-NPA using unification modulo homomorphic encryption S Escobar, D Kapur, C Lynch, C Meadows, J Meseguer, P Narendran, ... Proceedings of the 13th international ACM SIGPLAN symposium on Principles …, 2011 | 27 | 2011 |
| Redundancy criteria for constrained completion C Lynch, W Snyder Theoretical computer science 142 (2), 141-177, 1995 | 27 | 1995 |
| Effective symbolic protocol analysis via equational irreducibility conditions S Erbatur, S Escobar, D Kapur, Z Liu, C Lynch, C Meadows, J Meseguer, ... Computer Security–ESORICS 2012: 17th European Symposium on Research in …, 2012 | 26 | 2012 |
| Delving of sandy surfaced soils reduces frost damage in wheat crops M Rebbeck, C Lynch, PT Hayman, VO Sadras Australian Journal of Agricultural Research 58 (2), 105-112, 2007 | 26 | 2007 |
| Asymmetric unification: A new unification paradigm for cryptographic protocol analysis S Erbatur, S Escobar, D Kapur, Z Liu, CA Lynch, C Meadows, J Meseguer, ... Automated Deduction–CADE-24: 24th International Conference on Automated …, 2013 | 25 | 2013 |
| Paramodulation without duplication C Lynch Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 167-177, 1995 | 22 | 1995 |
| Automatic decidability and combinability revisited C Lynch, DK Tran Automated Deduction–CADE-21: 21st International Conference on Automated …, 2007 | 21 | 2007 |
