Abstract
We give an example of a set of linear equational axioms such that no finite canonical rewrite system can be computed by ordered completion with a complete reduction ordering, although such a rewrite system does trivially exist. We then describe a set of inference rules for a completion procedure, called linear completion, that solves the problem when the axioms are linear.
Cite
CITATION STYLE
APA
Devie, H. (1991). Linear completion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 516 LNCS, pp. 233–245). Springer Verlag. https://doi.org/10.1007/3-540-54317-1_94
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free