Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient completion procedure, which is based on MaxSAT solving. Experiments show that the procedure is comparable to recent powerful completion tools. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems

The purpose of this thesis is to explore the methods to solve the tensor completion problem. Inspired by the matrix completion problem, the tensor completion problem is formulated as an unconstrained nonlinear optimization problem, which finds three factors that give a low-rank approximation. Various of iterative methods, including the gradient-based methods, stochastic gradient descent method ...

Approach uniformities were introduced in Lowen and Windels (1998) as the canonical generalization of both metric spaces and uniform spaces. This text presents in this new context of “quantitative” uniform spaces, a reflective completion theory which generalizes the well-known completions of metric and uniform spaces. This completion behaves nicely with respect to initial structures and hyperspa...