Efficient Ground Completion: An ::::O(n log n):::: Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E

Wayne Snyder. Efficient Ground Completion: An ::::O(n log n):::: Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E. In Nachum Dershowitz, editor, Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings. Volume 355 of Lecture Notes in Computer Science, pages 419-433, Springer, 1989.

Abstract

Abstract is missing.