12 papers:
CIKM-2006-ShahCJ #detection #documentation #representation- Representing documents with named entities for story link detection (SLD) (CS, WBC, DJ), pp. 868–869.
CL-2000-Brass #named #query #web- SLDMagic — The Real Magic (With Applications to Web Queries) (SB), pp. 1063–1077.
JICSLP-1996-Decker #abduction #database #deduction #maintenance- An Extension of SLD by Abduction and Integrity Maintenance for View Updating in Deductive Databases (HD), pp. 157–169.
ICLP-1995-BarklundDCL #semantics- Semantical Properties of SLD-Resolution with Reflection (JB, PD, SC, GAL), p. 830.
ILPS-1995-CominiLM #abstraction #composition- Compositionality in SLD-Derivations and their Abstractions (MC, GL, MCM), pp. 561–575.
PLILP-1994-Smith #multi #why- Why Multi-SLD Beats SLD (Even on a Uniprocessor) (DAS), pp. 40–56.
ILPS-1994-BarklundDCL #named- SLD — Resolution with Reflection (JB, PD, SC, GAL), pp. 554–568.
PLILP-1991-Boye #logic programming #named #semantics #source code- S-SLD-resolution — An Operational Semantics for Logic Programs with External Procedures (JB), pp. 383–393.
CSL-1989-Stark #proving- A Direct Proof for the Completeness of SLD-Resolution (RFS), pp. 382–383.
ICLP-1987-Vieille87 #proving- A Database-Complete Proof Procedure Based on SLD-Resolution (LV), pp. 74–103.
ICLP-1987-Yamamoto87- A Theoretical Combination of SLD-Resolution and Narrowing (AY), pp. 470–487.
SLP-1986-GallierR86 #horn clause #similarity- SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification (JHG, SR), pp. 168–179.