Basic completion with E-cycle simplification

DOI10.1007/BFB0055914MaRDI QIDQ4217958zbMATH OpenFDO

Authors Christopher Lynch, Christelle Scharff

Publication date 12 December 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Review text

See the review of the final version [Fundam. Inform. 39, No. 1-2, 145-165 (1999; Zbl 0951.68144)]. For the entire collection see [Zbl 0896.00032].

Recommendations

• scientific article; zbMATH DE number 1389652
• Completeness of E-unification with eager variable elimination
• Completion for logically constrained rewriting
• scientific article; zbMATH DE number 4053008
• Completion for constrained term rewriting systems
• General E-unification with eager variable elimination and a nice cycle rule
• On context-free rewriting with a simple restriction and its computational completeness
• scientific article; zbMATH DE number 176930
• scientific article; zbMATH DE number 4076598
• scientific article; zbMATH DE number 4164136

This page was built for publication: Basic completion with \(E\)-cycle simplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4217958)