Testing for inductive (co)-reducibility

DOI10.1007/3-540-52590-4_51MaRDI QIDQ4027631zbMATH OpenFDO

Authors Emmanuel Kounalis

Publication date 21 February 1993

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

Full work available at URL https://doi.org/10.1007/3-540-52590-4_51

zbMATH Keywords

equationsground terms in normal formproof by consistencyterm rewriting systemstest sets

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Testing for the ground (co-)reducibility property in term-rewriting systems
• scientific article; zbMATH DE number 4047062
• Computing ground reducibility and inductively complete positions
• Automatic proofs by induction in theories without constructors
• Term rewriting induction

Cited in

(13)

• Implicit induction in conditional theories
• Reasoning with conditional axioms
• scientific article; zbMATH DE number 4092759 (Why is no real title available?)
• Computing ground reducibility and inductively complete positions
• Proofs in parameterized specifications
• Program transformation and rewriting
• On relationship between term rewriting systems and regular tree languages
• Towards an efficient construction of test sets for deciding ground reducibility
• Equality and disequality constraints on direct subterms in tree automata
• Decidability of regularity and related properties of ground normal form languages
• Computing linearizations using test sets
• On sufficient completeness of conditional specifications
• Testing for the ground (co-)reducibility property in term-rewriting systems

This page was built for publication: Testing for inductive (co)-reducibility

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