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

DOI10.1007/978-3-642-12592-8_5MaRDI QIDQ3558285zbMATH OpenOpenAlexFDO

Authors Naoki Nishida, Germán Vidal, José Iborra

Publication date 4 May 2010

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12592-8_5

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Termination of Narrowing Using Dependency Pairs
• Reducing relative termination to dependency pair problems
• Termination of narrowing via termination of rewriting
• Termination of Narrowing in Left-Linear Constructor Systems
• Relative termination via dependency pairs

Cited in

(7)

• Relative termination via dependency pairs
• Narrowing-based simulation of term rewriting systems with extra variables and its termination proof
• Reducing relative termination to dependency pair problems
• Termination of Narrowing in Left-Linear Constructor Systems
• Termination of Narrowing Using Dependency Pairs
• A dependency pair framework for relative termination of term rewriting
• Termination of narrowing via termination of rewriting

Describes a project that uses

Uses Software

• AProVE
• MU-TERM

This page was built for publication: Goal-directed and relative dependency pairs for proving the termination of narrowing

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