 | 2009 |
|---|
| 38 |       | Maria Paola Bonacina,
Christopher Lynch,
Leonardo Mendonça de Moura:
On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving.
CADE 2009: 35-50 |
| 37 | | Siva Anantharaman,
Hai Lin,
Christopher Lynch,
Paliath Narendran,
Michaël Rusinowitch:
Unification Modulo Homomorphic Encryption.
FroCos 2009: 100-116 |
| 36 | | Christopher Lynch,
Ralph Eric McGregor:
Combining Instance Generation and Resolution.
FroCos 2009: 304-318 |
| 2008 |
|---|
| 35 | | Christopher Lynch,
Yuefeng Tang:
Interpolants for Linear Arithmetic in SMT.
ATVA 2008: 156-170 |
| 34 | | Christopher Lynch,
Duc-Khanh Tran:
SMELS: Satisfiability Modulo Equality with Lazy Superposition.
ATVA 2008: 186-200 |
| 33 | | Jeremy Bongio,
Cyrus Katrak,
Hai Lin,
Christopher Lynch,
Ralph Eric McGregor:
Encoding First Order Proofs in SMT.
Electr. Notes Theor. Comput. Sci. 198(2): 71-84 (2008) |
| 32 | | Christopher Lynch,
Yuefeng Tang:
Rewriting Interpolants.
Electr. Notes Theor. Comput. Sci. 212: 163-176 (2008) |
| 2007 |
|---|
| 31 | | Christopher Lynch,
Duc-Khanh Tran:
Automatic Decidability and Combinability Revisited.
CADE 2007: 328-344 |
| 30 | | Todd Deshane,
Wenjin Hu,
Patty Jablonski,
Hai Lin,
Christopher Lynch,
Ralph Eric McGregor:
Encoding First Order Proofs in SAT.
CADE 2007: 476-491 |
| 29 | | Christopher Lynch,
Hani Hagras,
Victor Callaghan:
Parallel Type-2 Fuzzy Logic Co-Processors for Engine Management.
FUZZ-IEEE 2007: 1-6 |
| 28 | | Stéphanie Delaune,
Hai Lin,
Christopher Lynch:
Protocol Verification Via Rigid/Flexible Resolution.
LPAR 2007: 242-256 |
| 2005 |
|---|
| 27 | | Christopher Lynch,
Barbara Morawska:
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories.
RTA 2005: 90-104 |
| 26 | | Christopher Lynch,
Catherine Meadows:
On the Relative Soundness of the Free Algebra Model for Public Key Encryption.
Electr. Notes Theor. Comput. Sci. 125(1): 43-54 (2005) |
| 2004 |
|---|
| 25 | | Christopher Lynch:
Unsound Theorem Proving.
CSL 2004: 473-487 |
| 24 | | Christopher Lynch,
Catherine Meadows:
Sound Approximations to Diffie-Hellman Using Rewrite Rules.
ICICS 2004: 262-277 |
| 2003 |
|---|
| 23 | | Christopher Lynch:
Schematic Saturation for Decision and Unification Problems.
CADE 2003: 427-441 |
| 2002 |
|---|
| 22 | | Christopher Lynch,
Barbara Morawska:
Basic Syntactic Mutation.
CADE 2002: 471-485 |
| 21 | | Christopher Lynch,
Barbara Morawska:
Automatic Decidability.
LICS 2002: 7- |
| 2001 |
|---|
| 20 | | Christopher Lynch,
Barbara Morawska:
Decidability and Complexity of Finitely Closable Linear Equational Theories.
IJCAR 2001: 499-513 |
| 19 | | Christopher Lynch,
Barbara Morawska:
Complexity of Linear Standard Theories.
LPAR 2001: 186-200 |
| 18 | | Christopher Lynch,
Barbara Morawska:
Goal-Directed E-Unification.
RTA 2001: 231-245 |
| 1999 |
|---|
| 17 |  | Christopher Lynch,
Christelle Scharff:
Basic Completion with E-cycle Simplification.
Fundam. Inform. 39(1-2): 145-165 (1999) |
| 1998 |
|---|
| 16 | | Christopher Lynch:
The Unification Problem for One Relation Thue Systems.
AISC 1998: 195-208 |
| 15 | | Christopher Lynch,
Christelle Scharff:
Basic Completion with E-cycle Simplification.
AISC 1998: 209-221 |
| 14 | | Christopher Lynch,
Polina Strogova:
SOUR graphs for efficient completion.
Discrete Mathematics & Theoretical Computer Science 2(1): 1-25 (1998) |
| 13 | | Christopher Lynch:
Local Simplification.
Inf. Comput. 142(1): 102-126 (1998) |
| 1997 |
|---|
| 12 | | Christopher Lynch:
Goal-Directed Completion Using SOUR Graphs.
RTA 1997: 8-22 |
| 11 | | Christopher Lynch:
Oriented Equational Logic Programming is Complete.
J. Symb. Comput. 23(1): 23-45 (1997) |
| 1996 |
|---|
| 10 | | Christopher Lynch,
Polina Strogova:
PATCH Graphs: An Efficient Data Structure for Completion of Finitely Presented Groups.
AISMC 1996: 176-190 |
| 9 | | Claude Kirchner,
Christopher Lynch,
Christelle Scharff:
Fine-Grained Concurrent Completion.
RTA 1996: 3-17 |
| 1995 |
|---|
| 8 | | Christopher Lynch:
Paramodulation without Duplication
LICS 1995: 167-177 |
| 7 | | Leo Bachmair,
Harald Ganzinger,
Christopher Lynch,
Wayne Snyder:
Basic Paramodulation
Inf. Comput. 121(2): 172-192 (1995) |
| 6 | | Christopher Lynch,
Wayne Snyder:
Redundancy Criteria for Constrained Completion.
Theor. Comput. Sci. 142(2): 141-177 (1995) |
| 1994 |
|---|
| 5 | | Christopher Lynch:
Local Simplification.
CCL 1994: 3-18 |
| 1993 |
|---|
| 4 | | Christopher Lynch,
Wayne Snyder:
Redundancy Criteria for Constrained Completion.
RTA 1993: 2-16 |
| 1992 |
|---|
| 3 | | Leo Bachmair,
Harald Ganzinger,
Christopher Lynch,
Wayne Snyder:
Basic Paramodulation and Superposition.
CADE 1992: 462-476 |
| 1991 |
|---|
| 2 | | Wayne Snyder,
Christopher Lynch:
Goal Directed Strategies for Paramodulation.
RTA 1991: 150-161 |
| 1990 |
|---|
| 1 | | 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.
CTRS 1990: 454-461 |
