Reducing relative termination to dependency pair problems

DOI10.1007/978-3-319-21401-6_11MaRDI QIDQ3454090zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Relative termination via dependency pairs
• Goal-directed and relative dependency pairs for proving the termination of narrowing
• Rewriting Techniques and Applications
• Termination of term rewriting using dependency pairs
• Termination of Narrowing Using Dependency Pairs

Cites work

• A dependency pair framework for \(A \vee C\)-termination
• Artificial Intelligence and Symbolic Computation
• Completion of rewrite systems with membership constraints. I: Deduction rules
• Confluence by critical pair analysis
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Decreasing diagrams and relative termination
• Frontiers of Combining Systems
• Goal-directed and relative dependency pairs for proving the termination of narrowing
• scientific article; zbMATH DE number 1722701 (Why is no real title available?)
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• Matrix interpretations for proving termination of term rewriting
• Mechanizing and improving dependency pairs
• Nagoya termination tool
• Narrowing-based simulation of term rewriting systems with extra variables and its termination proof
• On the formalization of termination techniques based on multiset orderings
• Rewriting Techniques and Applications
• Termination of Narrowing in Left-Linear Constructor Systems
• Termination of narrowing via termination of rewriting
• Termination of rewriting
• Termination of term rewriting using dependency pairs
• TPA: Termination Proved Automatically

Cited in

(2)

• Relative termination via dependency pairs
• Goal-directed and relative dependency pairs for proving the termination of narrowing

Describes a project that uses

Uses Software

• TPA
• Nagoya Termination Tool
• Tyrolean

This page was built for publication: Reducing relative termination to dependency pair problems

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