Lazy narrowing: strong completeness and eager variable elimination

DOI10.1016/0304-3975(96)00071-0zbMath0874.68157OpenAlexW2138364864MaRDI QIDQ671677

Tetsuo Ida, Satoshi Okui, Aart Middeldorp

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00071-0

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (13)

General \(E\)-unification with eager variable elimination and a nice cycle rule ⋮ Semantic forgetting in answer set programming ⋮ Complete symbolic reachability analysis using back-and-forth narrowing ⋮ Higher-order narrowing with convergent systems ⋮ Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ The unification problem for confluent right-ground term rewriting systems. ⋮ On the limits of forgetting in answer set programming ⋮ Evaluation strategies for functional logic programming ⋮ Functional Logic Programming: From Theory to Curry ⋮ Solving Equations by Graph Transformation ⋮ On syntactic forgetting under uniform equivalence ⋮ Hot Topics in Reduction Strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating outer narrowing derivations for constructor-based term rewriting systems
• A proof theory for general unification
• Complete sets of transformations for general E-unification
• A deterministic lazy narrowing calculus
• Completeness results for basic narrowing
• Foundations of equational logic programming
• Basic paramodulation
• Proving termination with multiset orderings
• An Efficient Unification Algorithm
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• The integration of functions into logic programming: From theory to practice
• Improving transformation systems for general E-unification
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Lazy narrowing: strong completeness and eager variable elimination