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

Wayne Snyder Efficient Ground Completion: An <i>O(n log n)</i> Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E. 419-433 1989 conf/rta/1989 RTA db/conf/rta/rta89.html#Snyder89 http://dx.doi.org/10.1007/3-540-51081-8_123