Towards an efficient construction of test sets for deciding ground reducibility

DOI10.1007/3-540-59200-8_49zbMath1503.68153OpenAlexW1510724501MaRDI QIDQ5055821

K. Schmid, Roland Fettig

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_49

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Testing for the ground (co-)reducibility property in term-rewriting systems
• Automating inductionless induction using test sets
• On sufficient-completeness and related properties of term rewriting systems
• Linearizing term rewriting systems using test sets
• Automatic proofs by induction in theories without constructors
• Semantic confluence tests and completion methods
• Equality and disequality constraints on direct subterms in tree automata
• Decidability of regularity and related properties of ground normal form languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards an efficient construction of test sets for deciding ground reducibility