scientific article; zbMATH DE number 4011938

MaRDI QIDQ3761697zbMATH OpenFDO

Authors Deepak Kapur, Paliath Narendran, Hantao Zhang

Publication date 1986

zbMATH Keywords

equational specificationsnormal formsPSPACE-hardsufficient-completeness propertyterm rewriting systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Sufficient-completeness, ground-reducibility and their complexity
• On sufficient-completeness and related properties of term rewriting systems
• Checking Sufficient Completeness by Inductive Theorem Proving
• Sufficient completeness verification for conditional and constrained TRS
• scientific article; zbMATH DE number 4049024

Cited in

(5)

• Sufficient-completeness, ground-reducibility and their complexity
• Constructors, sufficient completeness, and deadlock freedom of rewrite theories
• Complexity, decidability and completeness
• Computing and Combinatorics
• On ground-confluence of term rewriting systems

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