Search the dblp DataBase
Christopher Lynch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
Basic Paramodulation and Superposition. [Citation Graph (1, 0)][DBLP]
CADE, 1992, pp:462-476 [Conf] - Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
Basic Paramodulation [Citation Graph (1, 0)][DBLP]
Inf. Comput., 1995, v:121, n:2, pp:172-192 [Journal] - Christopher Lynch
The Unification Problem for One Relation Thue Systems. [Citation Graph (0, 0)][DBLP]
AISC, 1998, pp:195-208 [Conf] - Christopher Lynch, Polina Strogova
PATCH Graphs: An Efficient Data Structure for Completion of Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
AISMC, 1996, pp:176-190 [Conf] - Christopher Lynch, Christelle Scharff
Basic Completion with E-cycle Simplification. [Citation Graph (0, 0)][DBLP]
AISC, 1998, pp:209-221 [Conf] - Christopher Lynch
Schematic Saturation for Decision and Unification Problems. [Citation Graph (0, 0)][DBLP]
CADE, 2003, pp:427-441 [Conf] - Christopher Lynch, Barbara Morawska
Decidability and Complexity of Finitely Closable Linear Equational Theories. [Citation Graph (0, 0)][DBLP]
IJCAR, 2001, pp:499-513 [Conf] - Christopher Lynch, Barbara Morawska
Basic Syntactic Mutation. [Citation Graph (0, 0)][DBLP]
CADE, 2002, pp:471-485 [Conf] - Christopher Lynch
Local Simplification. [Citation Graph (0, 0)][DBLP]
CCL, 1994, pp:3-18 [Conf] - Christopher Lynch
Unsound Theorem Proving. [Citation Graph (0, 0)][DBLP]
CSL, 2004, pp:473-487 [Conf] - Wayne Snyder, Christopher Lynch
An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of Equality. [Citation Graph (0, 0)][DBLP]
CTRS, 1990, pp:454-461 [Conf] - Christopher Lynch, Catherine Meadows
Sound Approximations to Diffie-Hellman Using Rewrite Rules. [Citation Graph (0, 0)][DBLP]
ICICS, 2004, pp:262-277 [Conf] - Christopher Lynch
Paramodulation without Duplication [Citation Graph (0, 0)][DBLP]
LICS, 1995, pp:167-177 [Conf] - Christopher Lynch, Barbara Morawska
Automatic Decidability. [Citation Graph (0, 0)][DBLP]
LICS, 2002, pp:7-0 [Conf] - Christopher Lynch, Barbara Morawska
Complexity of Linear Standard Theories. [Citation Graph (0, 0)][DBLP]
LPAR, 2001, pp:186-200 [Conf] - Claude Kirchner, Christopher Lynch, Christelle Scharff
Fine-Grained Concurrent Completion. [Citation Graph (0, 0)][DBLP]
RTA, 1996, pp:3-17 [Conf] - Christopher Lynch
Goal-Directed Completion Using SOUR Graphs. [Citation Graph (0, 0)][DBLP]
RTA, 1997, pp:8-22 [Conf] - Christopher Lynch, Barbara Morawska
Goal-Directed E-Unification. [Citation Graph (0, 0)][DBLP]
RTA, 2001, pp:231-245 [Conf] - Christopher Lynch, Barbara Morawska
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. [Citation Graph (0, 0)][DBLP]
RTA, 2005, pp:90-104 [Conf] - Christopher Lynch, Wayne Snyder
Redundancy Criteria for Constrained Completion. [Citation Graph (0, 0)][DBLP]
RTA, 1993, pp:2-16 [Conf] - Wayne Snyder, Christopher Lynch
Goal Directed Strategies for Paramodulation. [Citation Graph (0, 0)][DBLP]
RTA, 1991, pp:150-161 [Conf] - Christopher Lynch, Polina Strogova
SOUR graphs for efficient completion. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics & Theoretical Computer Science, 1998, v:2, n:1, pp:1-25 [Journal] - Christopher Lynch, Catherine Meadows
On the Relative Soundness of the Free Algebra Model for Public Key Encryption. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2005, v:125, n:1, pp:43-54 [Journal] - Christopher Lynch, Christelle Scharff
Basic Completion with E-cycle Simplification. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 1999, v:39, n:1-2, pp:145-165 [Journal] - Christopher Lynch
Local Simplification. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1998, v:142, n:1, pp:102-126 [Journal] - Christopher Lynch
Oriented Equational Logic Programming is Complete. [Citation Graph (0, 0)][DBLP]
J. Symb. Comput., 1997, v:23, n:1, pp:23-45 [Journal] - Christopher Lynch, Wayne Snyder
Redundancy Criteria for Constrained Completion. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1995, v:142, n:2, pp:141-177 [Journal] - Christopher Lynch, Duc-Khanh Tran
Automatic Decidability and Combinability Revisited. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:328-344 [Conf] - Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin, Christopher Lynch, Ralph Eric McGregor
Encoding First Order Proofs in SAT. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:476-491 [Conf] - Stéphanie Delaune, Hai Lin, Christopher Lynch
Protocol Verification Via Rigid/Flexible Resolution. [Citation Graph (0, 0)][DBLP]
LPAR, 2007, pp:242-256 [Conf]
SMELS: Satisfiability Modulo Equality with Lazy Superposition. [Citation Graph (, )][DBLP]
Interpolants for Linear Arithmetic in SMT. [Citation Graph (, )][DBLP]
On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving. [Citation Graph (, )][DBLP]
Cap unification: application to protocol security modulo homomorphic encryption. [Citation Graph (, )][DBLP]
Unification Modulo Homomorphic Encryption. [Citation Graph (, )][DBLP]
Combining Instance Generation and Resolution. [Citation Graph (, )][DBLP]
Parallel Type-2 Fuzzy Logic Co-Processors for Engine Management. [Citation Graph (, )][DBLP]
Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List). [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Encoding First Order Proofs in SMT. [Citation Graph (, )][DBLP]
Rewriting Interpolants. [Citation Graph (, )][DBLP]
Search in 0.037secs, Finished in 0.040secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002