The following pages link to Narrowing vs. SLD-resolution (Q1105364):
Displaying 13 items.
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Functional-logic integration via minimal reciprocal extensions (Q1275622) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- A framework for incremental learning of logic programs (Q1390950) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- Evaluation strategies for functional logic programming (Q2456576) (← links)
- Declarative debugging of functional logic programs (Q2841221) (← links)
- A debugging scheme for functional logic programs (Q2841284) (← links)
- Detecting redundant narrowing derivations by the LSE-SL reducibility test (Q5055750) (← links)
- On narrowing, refutation proofs and constraints (Q5055818) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- An optimal narrowing strategy for general canonical systems (Q5881212) (← links)
