scientific article
From MaRDI portal
Publication:3783519
zbMath0642.68034MaRDI QIDQ3783519
Deepak Kapur, Paliath Narendran, Han-Tao Zhang
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
consistencyequational theoriessufficient completenessinductionless inductionKnuth-Bendix completion procedureproof by induction
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (20)
Computing linearizations using test sets ⋮ Confluence of terminating membership conditional TRS ⋮ Conditional rewriting in focus ⋮ Proof by consistency in conditional equational theories ⋮ Completion procedures as semidecision procedures ⋮ Proof by consistency ⋮ Computing ground reducibility and inductively complete positions ⋮ Inductive proofs by specification transformations ⋮ Rewriting techniques for program synthesis ⋮ Proving Ramsey's theory by the cover set induction: A case and comparision study. ⋮ Sufficient-completeness, ground-reducibility and their complexity ⋮ Only prime superpositions need be considered in the Knuth-Bendix completion procedure ⋮ Applying term rewriting methods to finite groups ⋮ Test sets for the universal and existential closure of regular tree languages. ⋮ Towards a foundation of completion procedures as semidecision procedures ⋮ Mechanically certifying formula-based Noetherian induction reasoning ⋮ Proving weak properties of rewriting ⋮ Mechanizable inductive proofs for a class of ∀ ∃ formulas ⋮ Automating inductionless induction using test sets ⋮ A strong restriction of the inductive completion procedure
Uses Software
This page was built for publication:
