Termination of Narrowing Using Dependency Pairs
From MaRDI portal
Publication:5504664
Recommendations
Cites work
- scientific article; zbMATH DE number 1761889 (Why is no real title available?)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- 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 Using Dependency Pairs
- Termination of narrowing revisited
- 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
- An integrated framework for the diagnosis and correction of rule-based programs
- Goal-directed and relative dependency pairs for proving the termination of narrowing
- Termination of narrowing via termination of rewriting
- Termination of Narrowing Using Dependency Pairs
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)