Partial completion of equational theories

DOI10.1007/BF02948837zbMath0966.68092OpenAlexW2086863374MaRDI QIDQ1592635

Kai Lin, Chaojun Lu, Yong-Qiang Sun

Publication date: 25 January 2001

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948837

zbMATH Keywords

term rewriting systempartial completion

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proofs by induction in equational theories with constructors
• Refutational theorem proving using term-rewriting systems
• Termination of rewriting
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Completion for rewriting modulo a congruence
• Completion of a Set of Rules Modulo a Set of Equations
• Abstract Data Type Specification in the Affirm System
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Complete Sets of Reductions for Some Equational Theories
• Abstract data types and software validation
• On the Church-Rosser property for the direct sum of term rewriting systems
• Equality, types, modules, and (why not?) generics for logic programming

This page was built for publication: Partial completion of equational theories