Testing for the ground (co-)reducibility property in term-rewriting systems
From MaRDI portal
Publication:685352
DOI10.1016/0304-3975(92)90279-OzbMATH Open0776.68069MaRDI QIDQ685352FDOQ685352
Publication date: 25 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Knuth-Bendix completionarbitrary term-rewriting systemsground-co-reducibleground-reduciblemechanizing inductive proofs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- On sufficient-completeness and related properties of term rewriting systems
- Proofs by induction in equational theories with constructors
- Automatic proofs by induction in theories without constructors
- Semantic confluence tests and completion methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing ground reducibility and inductively complete positions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Proving weak properties of rewriting
- Using induction and rewriting to verify and complete parameterized specifications
- Ground reducibility is EXPTIME-complete
- Mechanizable inductive proofs for a class of ∀ ∃ formulas
- Observational proofs by rewriting.
- Title not available (Why is that?)
- Pumping, cleaning and symbolic constraints solving
- Towards an efficient construction of test sets for deciding ground reducibility
- Computing ground reducibility and inductively complete positions
- Test sets for the universal and existential closure of regular tree languages.
- Title not available (Why is that?)
Recommendations
This page was built for publication: Testing for the ground (co-)reducibility property in term-rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685352)
