×

Lynch, Christopher S.

Author ID: lynch.christopher-s Recent zbMATH articles by "Lynch, Christopher S."
Published as: Lynch, Christopher S.; Lynch, C. S.

Publications by Year

Citations contained in zbMATH Open

23 Publications have been cited 2 times in 2 Documents Cited by Year
Basic paramodulation and superposition. Zbl 0925.03052
Bachmair, Leo; Ganzinger, Harald; Lynch, Christopher; Snyder, Wayne
25
1992
Basic paramodulation. Zbl 0833.68115
Bachmair, Leo; Ganzinger, Harald; Lynch, Christopher; Snyder, Wayne
25
1995
Automatic decidability and combinability revisited. Zbl 1213.68573
Lynch, Christopher; Tran, Duc-Khanh
7
2007
Basic syntactic mutation. Zbl 1072.68581
Lynch, Christopher; Morawska, Barbara
6
2002
Automatic decidability and combinability. Zbl 1216.68163
Lynch, Christopher; Ranise, Silvio; Ringeissen, Christophe; Tran, Duc-Khanh
6
2011
Redundancy criteria for constrained completion. Zbl 0873.68189
Lynch, Christopher; Snyder, Wayne
5
1995
Interpolants for linear arithmetic in SMT. Zbl 1183.68379
Lynch, Christopher; Tang, Yuefeng
5
2008
Varieties of positive implicative BCK-algebras. Subdirectly irreducible and free algebras. Zbl 0791.06016
Guzmán, Fernando; Lynch, Christopher
4
1992
Unsound theorem proving. Zbl 1095.68112
Lynch, Christopher
4
2004
Goal directed strategies for paramodulation. Zbl 1503.68295
Snyder, Wayne; Lynch, Christopher
3
1991
Decidability and complexity of finitely closable linear equational theories. Zbl 0988.03013
Lynch, Christopher; Morawska, Barbara
2
2001
Orthotropic rescaling for crack tip fields in linear piezoelectric materials. Zbl 1119.74560
Lynch, Christopher S.; Oates, William S.
2
2004
Oriented equational logic programming is complete. Zbl 0878.68037
Lynch, Christopher
2
1997
SMELS: Satisfiability modulo equality with lazy superposition. Zbl 1183.68559
Lynch, Christopher; Tran, Duc-Khanh
2
2008
Formal analysis of symbolic authenticity. Zbl 07497927
Lin, Hai; Lynch, Christopher
1
2021
Faster basic syntactic mutation with sorts for some separable equational theories. Zbl 1078.68659
Lynch, Christopher; Morawska, Barbara
1
2005
SOUR graphs for efficient completion. Zbl 0947.68083
Lynch, Christopher; Strogova, Polina
1
1998
Goal-directed \(E\)-unification. Zbl 0981.68064
Lynch, Christopher; Morawska, Barbara
1
2001
Constructing Bachmair-Ganzinger models. Zbl 1383.68079
Lynch, Christopher
1
2013
Fine-grained concurrent completion. Zbl 1503.68123
Kirchner, Claude; Lynch, Christopher; Scharff, Christelle
1
1996
An inference system for Horn clause logic with equality. A foundation for conditional \(E\)-unification and for logic programming in the presence of equality. Zbl 1507.68340
Snyder, Wayne; Lynch, Christopher
1
1991
Bounded ACh unification. Zbl 1495.68111
Eeralla, Ajay Kumar; Lynch, Christopher
1
2020
Change-point analysis of asset price bubbles with power-law hazard function. Zbl 1454.91256
Lynch, Christopher; Mestel, Benjamin
1
2019
Formal analysis of symbolic authenticity. Zbl 07497927
Lin, Hai; Lynch, Christopher
1
2021
Bounded ACh unification. Zbl 1495.68111
Eeralla, Ajay Kumar; Lynch, Christopher
1
2020
Change-point analysis of asset price bubbles with power-law hazard function. Zbl 1454.91256
Lynch, Christopher; Mestel, Benjamin
1
2019
Constructing Bachmair-Ganzinger models. Zbl 1383.68079
Lynch, Christopher
1
2013
Automatic decidability and combinability. Zbl 1216.68163
Lynch, Christopher; Ranise, Silvio; Ringeissen, Christophe; Tran, Duc-Khanh
6
2011
Interpolants for linear arithmetic in SMT. Zbl 1183.68379
Lynch, Christopher; Tang, Yuefeng
5
2008
SMELS: Satisfiability modulo equality with lazy superposition. Zbl 1183.68559
Lynch, Christopher; Tran, Duc-Khanh
2
2008
Automatic decidability and combinability revisited. Zbl 1213.68573
Lynch, Christopher; Tran, Duc-Khanh
7
2007
Faster basic syntactic mutation with sorts for some separable equational theories. Zbl 1078.68659
Lynch, Christopher; Morawska, Barbara
1
2005
Unsound theorem proving. Zbl 1095.68112
Lynch, Christopher
4
2004
Orthotropic rescaling for crack tip fields in linear piezoelectric materials. Zbl 1119.74560
Lynch, Christopher S.; Oates, William S.
2
2004
Basic syntactic mutation. Zbl 1072.68581
Lynch, Christopher; Morawska, Barbara
6
2002
Decidability and complexity of finitely closable linear equational theories. Zbl 0988.03013
Lynch, Christopher; Morawska, Barbara
2
2001
Goal-directed \(E\)-unification. Zbl 0981.68064
Lynch, Christopher; Morawska, Barbara
1
2001
SOUR graphs for efficient completion. Zbl 0947.68083
Lynch, Christopher; Strogova, Polina
1
1998
Oriented equational logic programming is complete. Zbl 0878.68037
Lynch, Christopher
2
1997
Fine-grained concurrent completion. Zbl 1503.68123
Kirchner, Claude; Lynch, Christopher; Scharff, Christelle
1
1996
Basic paramodulation. Zbl 0833.68115
Bachmair, Leo; Ganzinger, Harald; Lynch, Christopher; Snyder, Wayne
25
1995
Redundancy criteria for constrained completion. Zbl 0873.68189
Lynch, Christopher; Snyder, Wayne
5
1995
Basic paramodulation and superposition. Zbl 0925.03052
Bachmair, Leo; Ganzinger, Harald; Lynch, Christopher; Snyder, Wayne
25
1992
Varieties of positive implicative BCK-algebras. Subdirectly irreducible and free algebras. Zbl 0791.06016
Guzmán, Fernando; Lynch, Christopher
4
1992
Goal directed strategies for paramodulation. Zbl 1503.68295
Snyder, Wayne; Lynch, Christopher
3
1991
An inference system for Horn clause logic with equality. A foundation for conditional \(E\)-unification and for logic programming in the presence of equality. Zbl 1507.68340
Snyder, Wayne; Lynch, Christopher
1
1991

Citations by Year