Titlebook: Conditional and Typed Rewriting Systems; 2nd International CT S. Kaplan,M. Okada Conference proceedings 1991 Springer-Verlag Berlin Heidelb

obstinate

apiary

破譯

murmur

Linear completion,lete 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.

字形刻痕

https://doi.org/10.1007/978-3-662-56499-8 as special cases or generalize many known results about about ordered Knuth-Bendix-like completion of equations, of Horn clauses, of Horn clauses over built-in Booleans, about completion of first-order clauses by clausal rewriting, and inductive theorem proving for Horn clauses.