scientific article; zbMATH DE number 4043234
From MaRDI portal
Publication:3780428
zbMATH Open0639.68029MaRDI QIDQ3780428FDOQ3780428
Authors: Richard Göbel 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Ground confluence prover based on rewriting induction
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- The Knuth-Bendix Completion Procedure and Thue Systems
- On ground-confluence of term rewriting systems
General topics in the theory of software (68N01) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65)
Cited In (11)
- Complete sets of reductions with constraints
- Title not available (Why is that?)
- Improving rewriting induction approach for proving ground confluence
- Testing for the ground (co-)reducibility property in term-rewriting systems
- Ground confluence prover based on rewriting induction
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
- On ground and consequence
- Decidability of confluence and termination of monadic term rewriting systems
- A strong restriction of the inductive completion procedure
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780428)
