Searching for authors named "Christopher Lynch" – sorted by Relevance.
-
Paramodulation without Duplication
- Paramodulation without Duplication Christopher Lynch INRIA Lorraine et CRIN Campus Scientique BP
- Cited by 12 (7 self) – Add To MetaCart
-
Goal-Directed Completion using SOUR Graphs
- GoalDirected Completion using SOUR Graphs Christopher Lynch y April 30, 1996 Abstract We give
- Cited by 2 (2 self) – Add To MetaCart
-
Basic Completion modulo E with Simplification
- Basic Completion modulo E with Simplication Christopher Lynch 1 and Christelle Schar 2 1
- Add To MetaCart
-
Decidability and Complexity of Finitely Closable Linear Equational Theories
- Decidability and Complexity of Finitely Closable Linear Equational Theories Christopher Lynch
- Cited by 2 (2 self) – Add To MetaCart
-
Goal-Directed E-Unification
- Goal-Directed E-Unification Christopher Lynch and Barbara Morawska Department of Mathematics
- Cited by 1 (1 self) – Add To MetaCart
-
SOUR graphs for efficient completion
- completion Christopher Lynch 1y and Polina Strogova 2 1 Department of Mathematics and Computer Science
- Cited by 2 (2 self) – Add To MetaCart
-
PATCH graphs: an efficient data structure for completion of finitely presented groups
- Lynch 1 and Polina Strogova 2 1 INRIA Lorraine - CRIN 2 INRIA Lorraine - CRIN and INRIA
- Cited by 1 (1 self) – Add To MetaCart
-
Approximating E-Unification
- Approximating E-Unification Christopher Lynch and Barbara Morawska Department of Mathematics
- Cited by 1 (1 self) – Add To MetaCart
-
Basic Completion with E-cycle Simplification
- Christopher Lynch Department of Mathematics and Computer Science Clarkson University Box 5815, Potsdam, NY
- Cited by 3 (1 self) – Add To MetaCart
-
Redundancy Criteria for Constrained Completion
- Redundancy Criteria for Constrained Completion Christopher Lynch Wayne Snyder March 5, 1995
- Cited by 5 (1 self) – Add To MetaCart

