Pages that link to "Item:Q671677"
From MaRDI portal
The following pages link to Lazy narrowing: strong completeness and eager variable elimination (Q671677):
Displaying 13 items.
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- The unification problem for confluent right-ground term rewriting systems. (Q1401934) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Evaluation strategies for functional logic programming (Q2456576) (← links)
- General \(E\)-unification with eager variable elimination and a nice cycle rule (Q2642468) (← links)
- Hot Topics in Reduction Strategies (Q2841229) (← links)
- When you must forget: Beyond strong persistence when forgetting in answer set programming (Q4592710) (← links)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- Solving Equations by Graph Transformation (Q4923538) (← links)
- Higher-order narrowing with convergent systems (Q5096386) (← links)
- Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) (Q5096745) (← links)
