scientific article; zbMATH DE number 4164136

MaRDI QIDQ3490948zbMATH OpenFDO

Authors Wadoud Bousdira

Publication date 1989

zbMATH Keywords

completion procedurespecificationsconditional rewriting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Recommendations

• Publication:5749279
• Completion for constrained term rewriting systems
• Completion for logically constrained rewriting
• scientific article; zbMATH DE number 3878354
• Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
• A Completion Method to Decide Reachability in Rewrite Systems
• Modular proofs for completeness of hierarchical term rewriting systems
• Completion of rewrite systems with membership constraints
• scientific article; zbMATH DE number 4092749
• Combinations of simplifying conditional term rewriting systems

Cited in

(6)

• scientific article; zbMATH DE number 1222433 (Why is no real title available?)
• A Completion Method to Decide Reachability in Rewrite Systems
• scientific article; zbMATH DE number 3878354 (Why is no real title available?)
• Completion of rewrite systems with membership constraints. I: Deduction rules
• Completion of rewrite systems with membership constraints
• Completeness of rewrite rules and rewrite strategies for FP

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