Reducing Relative Termination to Dependency Pair Problems

DOI10.1007/978-3-319-21401-6_11zbMath1465.68120OpenAlexW1440841471MaRDI QIDQ3454090

Naoki Nishida, Germán Vidal, Akihisa Yamada, José Iborra

Publication date: 2 December 2015

Published in: Automated Deduction - CADE-25 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/65714

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Relative termination via dependency pairs

Uses Software

• Tyrolean
• TPA
• Nagoya Termination Tool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decreasing diagrams and relative termination
• Mechanizing and improving dependency pairs
• Matrix interpretations for proving termination of term rewriting
• Termination of narrowing via termination of rewriting
• Termination of rewriting
• Completion of rewrite systems with membership constraints. I: Deduction rules
• Termination of term rewriting using dependency pairs
• TPA: Termination Proved Automatically
• Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A Dependency Pair Framework for A ∨ C-Termination
• On the Formalization of Termination Techniques based on Multiset Orderings
• Confluence by Critical Pair Analysis
• Nagoya Termination Tool
• Termination of Narrowing in Left-Linear Constructor Systems
• Artificial Intelligence and Symbolic Computation
• Frontiers of Combining Systems
• Rewriting Techniques and Applications

This page was built for publication: Reducing Relative Termination to Dependency Pair Problems