Termination of Narrowing Using Dependency Pairs

DOI10.1007/978-3-540-89982-2_31MaRDI QIDQ5504664zbMATH OpenOpenAlexWikidataFDO

Authors Santiago Escobar, María Alpuente, José Iborra

Publication date 22 January 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89982-2_31

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Goal-directed and relative dependency pairs for proving the termination of narrowing
• Termination of term rewriting using dependency pairs
• Logic for Programming, Artificial Intelligence, and Reasoning
• Improving dependency pairs
• Automated Reasoning

Cites work

• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
• scientific article; zbMATH DE number 1761889 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Mechanizing and improving dependency pairs
• Modular Termination of Basic Narrowing
• Narrowing-based simulation of term rewriting systems with extra variables and its termination proof
• Proving termination of context-sensitive rewriting with MU-TERM
• Rewriting Techniques and Applications
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Termination of narrowing revisited
• Termination of Narrowing Using Dependency Pairs
• Termination of narrowing via termination of rewriting
• Termination of term rewriting using dependency pairs
• The integration of functions into logic programming: From theory to practice

Cited in

(5)

• Reducing relative termination to dependency pair problems
• Goal-directed and relative dependency pairs for proving the termination of narrowing
• Termination of Narrowing Using Dependency Pairs
• An integrated framework for the diagnosis and correction of rule-based programs
• Termination of narrowing via termination of rewriting

Describes a project that uses

Uses Software

• AProVE
• MU-TERM

This page was built for publication: Termination of Narrowing Using Dependency Pairs

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