Termination of generalized term rewriting systems

DOI10.4230/LIPICS.FSCD.2024.32MaRDI QIDQ6874975zbMATH OpenFDO

Authors Salvador Lucas

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2024.32

zbMATH Keywords

program analysisreduction-based systemstermination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Applications and extensions of context-sensitive rewriting
• Automatic generation of logical models with AGES
• Automatically Proving and Disproving Feasibility Conditions
• Characterizing and proving operational termination of deterministic conditional term rewriting systems
• Confluence of conditional rewriting modulo
• Constrained term rewriting tooL
• Context-sensitive dependency pairs
• Dependency pairs for proving termination properties of conditional term rewriting systems
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 1257634 (Why is no real title available?)
• scientific article; zbMATH DE number 837700 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• Local confluence of conditional and generalized term rewriting systems
• Logic for Programming, Artificial Intelligence, and Reasoning
• Mechanizing and improving dependency pairs
• Normal forms and normal theories in conditional rewriting
• Operational termination of conditional term rewriting systems
• Programming and symbolic computation in Maude
• Proving termination in the context-sensitive dependency pair framework
• Rewriting Techniques and Applications
• Semantic foundations for generalized rewrite theories
• Term Rewriting and All That
• Term Rewriting with Logical Constraints
• Termination of logic programs: Transformational methods revisited
• Termination of term rewriting using dependency pairs
• The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
• The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
• Using well-founded relations for proving operational termination

Cited in

(1)

• Confluence of almost parallel-closed generalized term rewriting systems

This page was built for publication: Termination of generalized term rewriting systems

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