A dependency pair framework for A C-termination

DOI10.1007/978-3-642-16310-4_4MaRDI QIDQ4933277zbMATH OpenOpenAlexFDO

Authors Beatriz Alarcón, Salvador Lucas, José Meseguer

Publication date 12 October 2010

Published in Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16310-4_4

zbMATH Keywords

dependency pairsequational rewritingtermination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• AC dependency pairs revisited
• scientific article; zbMATH DE number 1722701
• Logic for Programming, Artificial Intelligence, and Reasoning
• Modular termination proofs for rewriting using dependency pairs
• Automated Reasoning

Cited in

(12)

• Applications and extensions of context-sensitive rewriting
• The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
• Proving termination properties with \textsc{mu-term}
• Reducing relative termination to dependency pair problems
• Dependency pairs for proving termination properties of conditional term rewriting systems
• AC-KBO revisited
• mu-term: Verify Termination Properties Automatically (System Description)
• AC completion with termination tools
• AC dependency pairs revisited
• Small term reachability and related problems for terminating term rewriting systems
• On the complexity of the small term reachability problem for terminating term rewriting systems
• Simulating dependency pairs by semantic labeling

Describes a project that uses

Uses Software

• CafeOBJ
• Maude

This page was built for publication: A dependency pair framework for \(A \vee C\)-termination

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