Lazy narrowing: strong completeness and eager variable elimination
From MaRDI portal
Publication:671677
DOI10.1016/0304-3975(96)00071-0zbMATH Open0874.68157OpenAlexW2138364864MaRDI QIDQ671677FDOQ671677
Authors: Aart Middeldorp, Satoshi Okui, Tetsuo Ida 
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
Recommendations
- Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
- A deterministic lazy narrowing calculus
- Completeness of \(E\)-unification with eager variable elimination
- scientific article; zbMATH DE number 2217823
- Publication:4503959
- scientific article; zbMATH DE number 1950452
- scientific article; zbMATH DE number 1822269
- Lazy rewriting and eager machinery
- Termination of lazy rewriting revisited
Cites Work
- Proving termination with multiset orderings
- Title not available (Why is that?)
- An Efficient Unification Algorithm
- A Machine-Oriented Logic Based on the Resolution Principle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Basic paramodulation
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Completeness results for basic narrowing
- Title not available (Why is that?)
- Foundations of equational logic programming
- The integration of functions into logic programming: From theory to practice
- A proof theory for general unification
- Enumerating outer narrowing derivations for constructor-based term rewriting systems
- Complete sets of transformations for general E-unification
- A deterministic lazy narrowing calculus
- Title not available (Why is that?)
- Improving transformation systems for general E-unification
Cited In (17)
- Lazy narrowing with simplification
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
- The unification problem for confluent right-ground term rewriting systems.
- Folding variant narrowing and optimal variant termination
- Completeness results for basic narrowing
- General \(E\)-unification with eager variable elimination and a nice cycle rule
- Evaluation strategies for functional logic programming
- On syntactic forgetting under uniform equivalence
- On the limits of forgetting in answer set programming
- Title not available (Why is that?)
- Solving equations by graph transformation
- Hot topics in reduction strategies -- a panelist's view
- Higher-order narrowing with convergent systems
- Complete symbolic reachability analysis using back-and-forth narrowing
- Semantic forgetting in answer set programming
- Functional Logic Programming: From Theory to Curry
This page was built for publication: Lazy narrowing: strong completeness and eager variable elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671677)
