scientific article; zbMATH DE number 3870642

MaRDI QIDQ3336738zbMATH OpenFDO

Authors Pierre Lescanne

Publication date 1984

zbMATH Keywords

Knuth-Bendix completion algorithmREVERecursive Decomposition Ordering

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• Some experiments with a completion theorem prover
• scientific article; zbMATH DE number 3871338
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• scientific article; zbMATH DE number 4076598
• An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Cited in

(16)

• On term rewriting systems in unary signature
• A lower bound of the number of rewrite rules obtained by homological methods
• scientific article; zbMATH DE number 3871338 (Why is no real title available?)
• Fast Knuth-Bendix completion with a term rewriting system compiler
• scientific article; zbMATH DE number 4042147 (Why is no real title available?)
• Orienting rewrite rules with the Knuth-Bendix order.
• scientific article; zbMATH DE number 1836320 (Why is no real title available?)
• Algebraic semantics of rewriting terms and types
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• Universal algebras
• Categorification, term rewriting and the Knuth-Bendix procedure
• scientific article; zbMATH DE number 1522859 (Why is no real title available?)
• Some experiments with a completion theorem prover
• Symbol different term rewrite systems
• Extended term rewriting systems
• Applying term rewriting methods to finite groups

Describes a project that uses

Uses Software

• REVE

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 Q3336738)