dblp.uni-trier.dewww.uni-trier.de

Christopher Lynch Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
38EEMaria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura: On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving. CADE 2009: 35-50
37EESiva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch: Unification Modulo Homomorphic Encryption. FroCos 2009: 100-116
36EEChristopher Lynch, Ralph Eric McGregor: Combining Instance Generation and Resolution. FroCos 2009: 304-318
2008
35EEChristopher Lynch, Yuefeng Tang: Interpolants for Linear Arithmetic in SMT. ATVA 2008: 156-170
34EEChristopher Lynch, Duc-Khanh Tran: SMELS: Satisfiability Modulo Equality with Lazy Superposition. ATVA 2008: 186-200
33EEJeremy 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)
32EEChristopher Lynch, Yuefeng Tang: Rewriting Interpolants. Electr. Notes Theor. Comput. Sci. 212: 163-176 (2008)
2007
31EEChristopher Lynch, Duc-Khanh Tran: Automatic Decidability and Combinability Revisited. CADE 2007: 328-344
30EETodd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin, Christopher Lynch, Ralph Eric McGregor: Encoding First Order Proofs in SAT. CADE 2007: 476-491
29EEChristopher Lynch, Hani Hagras, Victor Callaghan: Parallel Type-2 Fuzzy Logic Co-Processors for Engine Management. FUZZ-IEEE 2007: 1-6
28EEStéphanie Delaune, Hai Lin, Christopher Lynch: Protocol Verification Via Rigid/Flexible Resolution. LPAR 2007: 242-256
2005
27EEChristopher Lynch, Barbara Morawska: Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. RTA 2005: 90-104
26EEChristopher 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
25EEChristopher Lynch: Unsound Theorem Proving. CSL 2004: 473-487
24EEChristopher Lynch, Catherine Meadows: Sound Approximations to Diffie-Hellman Using Rewrite Rules. ICICS 2004: 262-277
2003
23EEChristopher Lynch: Schematic Saturation for Decision and Unification Problems. CADE 2003: 427-441
2002
22EEChristopher Lynch, Barbara Morawska: Basic Syntactic Mutation. CADE 2002: 471-485
21EEChristopher Lynch, Barbara Morawska: Automatic Decidability. LICS 2002: 7-
2001
20EEChristopher Lynch, Barbara Morawska: Decidability and Complexity of Finitely Closable Linear Equational Theories. IJCAR 2001: 499-513
19EEChristopher Lynch, Barbara Morawska: Complexity of Linear Standard Theories. LPAR 2001: 186-200
18EEChristopher 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
16EEChristopher Lynch: The Unification Problem for One Relation Thue Systems. AISC 1998: 195-208
15EEChristopher Lynch, Christelle Scharff: Basic Completion with E-cycle Simplification. AISC 1998: 209-221
14EEChristopher 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
12EEChristopher 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
9EEClaude 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)
6EEChristopher 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
4EEChristopher Lynch, Wayne Snyder: Redundancy Criteria for Constrained Completion. RTA 1993: 2-16
1992
3EELeo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder: Basic Paramodulation and Superposition. CADE 1992: 462-476
1991
2EEWayne 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

Coauthor Index

1Siva Anantharaman [37]
2Leo Bachmair [3] [7]
3Maria Paola Bonacina [38]
4Jeremy Bongio [33]
5Victor Callaghan [29]
6Stéphanie Delaune [28]
7Todd Deshane [30]
8Harald Ganzinger [3] [7]
9Hani Hagras [29]
10Wenjin Hu [30]
11Patty Jablonski [30]
12Cyrus Katrak [33]
13Claude Kirchner [9]
14Hai Lin [28] [30] [33] [37]
15Ralph Eric McGregor [30] [33] [36]
16Catherine Meadows [24] [26]
17Barbara Morawska [18] [19] [20] [21] [22] [27]
18Leonardo Mendonça de Moura [38]
19Paliath Narendran [37]
20Michaël Rusinowitch [37]
21Christelle Scharff [9] [15] [17]
22Wayne Snyder [1] [2] [3] [4] [6] [7]
23Polina Strogova [10] [14]
24Yuefeng Tang [32] [35]
25Duc-Khanh Tran [31] [34]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)