Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
From MaRDI portal
Publication:5096745
Recommendations
Cites work
- scientific article; zbMATH DE number 4047179 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 1348470 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- A proof theory for general unification
- A refined version of general \(E\)-unification
- An Efficient Unification Algorithm
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Complete sets of transformations for general E-unification
- Completeness results for basic narrowing
- Enumerating outer narrowing derivations for constructor-based term rewriting systems
- Foundations of equational logic programming
- Improving transformation systems for general E-unification
- Lazy narrowing: strong completeness and eager variable elimination
- Proving termination with multiset orderings
- The integration of functions into logic programming: From theory to practice
Cited in
(3)
This page was built for publication: Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096745)