Termination of narrowing revisited

DOI10.1016/J.TCS.2009.07.037zbMATH Open1187.68271OpenAlexW2000232009WikidataQ57978189 ScholiaQ57978189MaRDI QIDQ1035697FDOQ1035697

Santiago Escobar, María Alpuente, José Iborra

Publication date: 4 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.037

Recommendations

• Termination of narrowing via termination of rewriting
• Termination of Narrowing in Left-Linear Constructor Systems
• Narrowing directed by a graph of terms
• A class of confluent term rewriting systems and unification
• scientific article; zbMATH DE number 969074

zbMATH Keywords

terminationnarrowingreachability problemsequational unification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Termination of term rewriting using dependency pairs
• Title not available (Why is that?)
• Termination of rewriting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Counterexamples to termination for the direct sum of term rewriting systems
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
• Foundations of Software Science and Computation Structures
• Completeness results for basic narrowing
• Unification theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of equational logic programming
• Declarative debugging of functional logic programs
• Abstract Diagnosis of Functional Programs
• The integration of functions into logic programming: From theory to practice
• Analyses of unsatisfiability for equational logic programming
• Incremental constraint satisfaction for equational logic programming
• Narrowing directed by a graph of terms
• Title not available (Why is that?)
• On modularity in term rewriting and narrowing
• Syntacticness, cycle-syntacticness and shallow theories
• Modular termination of basic narrowing and equational unification
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Optimizing Maude programs via program specialization
• Termination of Narrowing Using Dependency Pairs
• Symbolic Specialization of Rewriting Logic Theories with Presto
• Modular Termination of Basic Narrowing
• Title not available (Why is that?)
• Title not available (Why is that?)
• A compact fixpoint semantics for term rewriting systems
• Constant runtime complexity of term rewriting is semi-decidable
• Variant-Based Satisfiability in Initial Algebras
• A Non-Deterministic Multiset Query Language

Uses Software

• Haskell
• Maude

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)