Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Lynch, Christopher - Department of Mathematics and Computer Science, Clarkson University
Finegrained Concurrent Completion Claude Kirchner Christopher Lynch Christelle Scharff
Model Elimination with Basic Ordered Paramodulation
EOEcient Finitely Presented Groups Completion Using PATCH Graphs Christopher Lynch
Automatic Decidability Christopher Lynch and Barbara Morawska
Complexity of Linear Standard Theories Christopher Lynch and Barbara Morawska
J. Symbolic Computation (1996) 11, 1?? Oriented Equational Logic Programming is Complete
GoalDirected Completion using SOUR Graphs \Lambda Christopher Lynch y
Decidability and Complexity of Finitely Closable Linear Equational Theories
Basic Paramodulation Leo Bachmair \Lambda Harald Ganzinger y
Redundancy Criteria for Constrained Completion
Basic Syntactic Mutation Christopher Lynch and Barbara Morawska
PATCH Graphs: an EOEcient Data Structure for Completion of Finitely Presented Groups
SOUR Graphs for Efficient Completion Christopher Lynch y & Polina Strogova z
Discrete Mathematics and Theoretical Computer Science
Local Simplication Christopher Lynch
1. Let A mean that Ann comes to the party, B mean that Bill comes to the party, C mean that Carl comes to the party, and D mean that Debby
1. Let A mean that Ann comes to the party, B mean that Bill comes to the party, C mean that Carl comes to the party, and D mean that Dave comes
