Completeness results for basic narrowing

DOI10.1007/BF01190830zbMath0810.68088MaRDI QIDQ1328184

Erik Hamoen, Aart Middeldorp

Publication date: 4 July 1994

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

term rewriting systemsrewrite rulesbasic narrowing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (29)

Level-confluence of conditional rewrite systems with extra variables in right-hand sides ⋮ Complete symbolic reachability analysis using back-and-forth narrowing ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Incremental constraint satisfaction for equational logic programming ⋮ A new generic scheme for functional logic programming with constraints ⋮ Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude ⋮ Determinization of conditional term rewriting systems ⋮ Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) ⋮ Reversible computation in term rewriting ⋮ Symbolic Analysis of Maude Theories with Narval ⋮ Local confluence of conditional and generalized term rewriting systems ⋮ Strategies in conditional narrowing modulo SMT plus axioms ⋮ Modular Termination of Basic Narrowing ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems ⋮ Logicality of conditional rewrite systems ⋮ A compositional semantic basis for the analysis of equational Horn programs ⋮ Lazy narrowing: strong completeness and eager variable elimination ⋮ Computational Origami Construction as Constraint Solving and Rewriting ⋮ Unnamed Item ⋮ Termination of narrowing via termination of rewriting ⋮ Proving weak properties of rewriting ⋮ A compact fixpoint semantics for term rewriting systems ⋮ Implementing conditional term rewriting by graph rewriting ⋮ Shallow confluence of conditional term rewriting systems ⋮ Conditional narrowing modulo a set of equations ⋮ Termination of narrowing revisited ⋮ Induction for termination with local strategies ⋮ Higher order unification via explicit substitutions

Uses Software

• BABEL
• Kernel-LEAF

Cites Work

• Modular properties of conditional term rewriting systems
• On completeness of narrowing strategies
• A rationale for conditional equational programming
• Conditional rewrite rules
• Simplifying conditional term rewriting systems: Unification, termination and confluence
• Narrowing vs. SLD-resolution
• Conditional rewrite rules: Confluence and termination
• Enumerating outer narrowing derivations for constructor-based term rewriting systems
• Foundations of equational logic programming
• Basic narrowing revisited
• Kernel-LEAF: A logic plus functional language
• Proving termination with multiset orderings
• An Efficient Unification Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness results for basic narrowing