Recommendations
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 4041327 (Why is no real title available?)
- scientific article; zbMATH DE number 4080961 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 549952 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1952947 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 826301 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Abstract diagnosis of functional programs
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Analyses of unsatisfiability for equational logic programming
- Completeness results for basic narrowing
- Counterexamples to termination for the direct sum of term rewriting systems
- Declarative debugging of functional logic programs
- Foundations of Software Science and Computation Structures
- Foundations of equational logic programming
- Incremental constraint satisfaction for equational logic programming
- Modular termination of basic narrowing and equational unification
- Narrowing directed by a graph of terms
- On modularity in term rewriting and narrowing
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Syntacticness, cycle-syntacticness and shallow theories
- Termination of rewriting
- Termination of term rewriting using dependency pairs
- The integration of functions into logic programming: From theory to practice
- Unification theory
Cited in
(16)- Complete symbolic reachability analysis using back-and-forth narrowing
- Termination of Narrowing in Left-Linear Constructor Systems
- Symbolic Specialization of Rewriting Logic Theories with Presto
- A Non-Deterministic Multiset Query Language
- A compact fixpoint semantics for term rewriting systems
- Optimizing Maude programs via program specialization
- Narrowing trees for syntactically deterministic conditional term rewriting systems
- Modular Termination of Basic Narrowing
- Algebra and Coalgebra in Computer Science
- Termination of narrowing via termination of rewriting
- Constant runtime complexity of term rewriting is semi-decidable
- Narrowing-based simulation of term rewriting systems with extra variables and its termination proof
- Termination of Narrowing Using Dependency Pairs
- scientific article; zbMATH DE number 7453112 (Why is no real title available?)
- scientific article; zbMATH DE number 7455704 (Why is no real title available?)
- Variant-Based Satisfiability in Initial Algebras
This page was built for publication: Termination of narrowing revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035697)
