Partial completion of equational theories
From MaRDI portal
Recommendations
Cites work
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- Abstract Data Type Specification in the Affirm System
- Abstract data types and software validation
- Complete Sets of Reductions for Some Equational Theories
- Completion for rewriting modulo a congruence
- Completion of a Set of Rules Modulo a Set of Equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Equality, types, modules, and (why not?) generics for logic programming
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- On the Church-Rosser property for the direct sum of term rewriting systems
- Proofs by induction in equational theories with constructors
- Refutational theorem proving using term-rewriting systems
- Termination of rewriting
Cited in
(8)- Perfect bases for equational theories
- scientific article; zbMATH DE number 3871335 (Why is no real title available?)
- scientific article; zbMATH DE number 3896335 (Why is no real title available?)
- Computing knowledge in equational extensions of subterm convergent theories
- Maximal completion
- Linear completion
- A completion procedure for conditional equations
- Conditional equational theories and complete sets of transformations
This page was built for publication: Partial completion of equational theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592635)
