Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing

DOI10.1007/978-3-642-12592-8_5zbMath1284.68186OpenAlexW1496043728MaRDI QIDQ3558285

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)

Related Items (3)

Relative termination via dependency pairs ⋮ Reducing Relative Termination to Dependency Pair Problems ⋮ Termination of narrowing via termination of rewriting

Uses Software

• AProVE
• MU-TERM

This page was built for publication: Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing