scientific article
From MaRDI portal
Publication:3993260
zbMath0678.68095MaRDI QIDQ3993260
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
term rewritingproof transformationequational completionconfluence criterion for inductive completionKnuth-Bendix Completion Algorithmsubsumption criterion for resolution theorem proving
Abstract data types; algebraic specification (68Q65) Artificial intelligence (68T99) Thue and Post systems, etc. (03D03)
Related Items
Computing ground reducibility and inductively complete positions, Critical pair criteria for completion, Applying term rewriting methods to finite groups, On ground-confluence of term rewriting systems, On pot, pans and pudding or how to discover generalised critical Pairs, Completion for rewriting modulo a congruence, A completion procedure for conditional equations
