My Recent Publications:

So hot off the press they will burn your hand

Automatic Decidability , with Barbara Morawska. Proceedings of IEEE Symposium on Logic in Computer Science (LICS) , 2002.

Basic Syntactic Mutation , with Barbara Morawska. Proceedings of Conference on Automated Deduction (CADE) , Lecture Notes in Computer Science, 2002, Springer Verlag.

Complexity of Linear Standard Theories , with Barbara Morawska. Proceedings of Eighth International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) , Lecture Notes in Computer Science, volume 2250, pp. 188-200, 2001, Springer Verlag.

Decidability and Complexity of Finitely Closable Linear Equational Theories , with Barbara Morawska. Proceedings of First International Joint Conference on Automated Reasoning (IJCAR) , Lecture Notes in Computer Science, volume 2083, pp. 495-513, 2001, Springer Verlag.

Goal Directed E-Unification ,with Barbara Morawska. Proceedings of Twelfth International Conference on Rewriting Techniques and Applications (RTA) , Lecture Notes in Computer Science, volume 2051, 231-245, 2001, Springer Verlag.

Big gap where I was too lazy to put my papers on the web

Old

Goal Directed Completion using SOUR Graphs, Proceedings of Eighth International Conference on Rewriting Techniques and Applications (RTA) ,Lecture Notes in Computer Science, volume 1232, pp. 8-22, 1997, Springer Verlag. Abstract. Note: This is not the latest version of the papper. I will put that here when I find it.

Model Elimination plus with Basic Ordered Paramodulation, with Max Moser and Joachim Steinbach . Draft, as of January 12, 1996 (short version). Abstract.

Fine Grained Concurrent Completion, with Claude Kirchner and Christelle Scharff. Proceedings of Seventh International Conference on Rewriting Techniques and Applications (RTA) , Lecture Notes in Computer Science, volume 1103, 3-17, 1996, Springer Verlag. Abstract.

Patch Graphs: an efficient data structure for Completion of Finitely Presented Groups, with Polina Strogova. Proceedings of Third Annual Symposium on Artificial Intelligence and Symbolic Mathematical Computation (AISMC) , Lecture Notes in Computer Science, volume 1138, pp. 176-190, 1996, Springer Verlag. Abstract. Here is a draft of the long version.

SOUR Graphs for Efficient Completion, with Polina Strogova. , In Discrete Mathematics and Theoretical Computer Science Vol. 2, (1998) pp. 1--25, Abstract.

Check this page for some fun research, with Francois Bertault , Pierre Lescanne , and Paul Zimmerman .

Older

Paramodulation without Duplication , Proceedings of 10th International Symposium on Logic in Computer Science (LICS) , pages 167-177, Abstract.

Local Simplification, In Information and Computation , Vol. 142, (1998) pp. 102--126, Abstract.

Oriented Equational Logic Programming is Complete, In Journal of Symbolic Computation Vol. 23, No. 1, (1997) pp. 24-45, Abstract.

Redundancy Criteria for Constrained Completion, with Wayne Snyder , In Theoretical Computer Science , 142, No. 2(15 May 1995), 141-177, Abstract.

Basic Paramodulation, with Leo Bachmair , Harald Ganzinger , and Wayne Snyder , In Information and Computation , 121, No. 2(September 1995), 172-192, Abstract.


return back to C. Lynch's home page
mail to clynch@clarkson.edu