G. A. Ringwood
Abstract
Delving into the archives for the meaning of SLD reveals that the name is ill chosen. Furthermore, empiric evidence shows that the significance of the letters is entering the realms folklore. As clear logical thinking about a subject is impeded if the vocabulary is misleading or confused this note is intended to bring this matter to light before many more generations of logic programmers proliferate misconceptions. Clear logical thinking is of even greater import for a subject that purports to be about logic.
- Apt K.R. and van Emden M.H. (1982), Contributions to the Theory of Logic Programming, JACM 29, 841-62. Google Scholar
Digital Library
- Boyer R.S. (1971) Locking: a Restriction of Resolution, Ph.D. Thesis, University of Texas at Austin, Texas.Google Scholar
- Bratko I (1986) PROLOG Programming for Artificial Intelligence, Addison Wesley. Google ScholarDigital Library
- Chang C.-L and Lee R. C.-T (1973), Symbolic Logic and Mechanical Theorem Proving, Academic Press. Google ScholarDigital Library
- Cohen J. (1988) A View of the Origins and Development of Prolog, CACM 31, p. 26-36. Google ScholarDigital Library
- Colmerauer A., Kanoui H., Pasero R. and Roussel P. (1973) Un System de Communication Homme-machine en Francais, Rapport de Recherche, Groupe Intelligence Artificial, Universite d'Aix-Marseille.Google Scholar
- Colmerauer A (1983) Prolog en 10 Figures, Rapport de Recherche, Groupe Intelligence Artificial, Universite d'Aix-Marseille.Google Scholar
- Elcock EW (1988) Absys: the first logic programming language - a retrospective and commentary, to be published Jnl. Logic Programming. Google ScholarDigital Library
- Harel D. (1980) On Folk Theorems, CACM 23, 379-89. Google ScholarDigital Library
- Hewitt C. (1969) Planner: A language for Proving Theorems in Robots, Proc. IJCAI, Washington, 1969, p. 295-301.Google Scholar
- Hill R. (1974), LUSH-Resolution and its Completeness, DCL Memo 78, Dept. of AI, U. Edinburgh.Google Scholar
- Kowalski R.A. and Kuehner D. (1971), Linear Resolution with Selection Function, Artificial Intelligence, 2, 227-60.Google ScholarCross Ref
- Kowalski R.A. (1974) Predicate Logic as a Programming Language, Proc IFIP 74, North Holland, p. 569-74.Google Scholar
- Kowalski R.A. (1988) The Early Years of Logic Programming, CACM 31, p. 38-43. Google ScholarDigital Library
- Kuehner D. (1972) Some Special Purpose Resolution Systems, Machine Intelligence 7, Edinburgh University Press, 117-128.Google Scholar
- Lloyd J. (1984), Foundations of Logic Programming, Springer Verlag. Google ScholarDigital Library
- Reiter R. (1971) Two Results on Ordering for Resolution with Merging and Linear Format, JACM 14, 687-97. Google ScholarDigital Library
- Robinson J.A. (1983) Logic Programming: past, present and future, Tech Rept TR- 015, ICOT, Tokyo.Google Scholar
- Slagle J.R. and Norton L. (1971) Experiments with an Automated Theorem Prover Having Partial Ordering Rules, Division of Computer Research and Technology, National Inst. Health, Besthesda, Maryland.Google Scholar
- Sterling L. and Shapiro E. (1986), The Art of Prolog, MIT Press.Google Scholar
- van Emden M.H. [1977], Programming in Resolution Logic, Machine Intelligence 8, p. 266-99.Google Scholar
Index Terms
- SLD: a folk acronym?
Recommendations
A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs
We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLD-resolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, ...
A fixpoint semantics and an SLD-resolution calculus for modal logic programs
We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLD-resolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, ...
A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions
This paper presents a full formalization of the semantics of definite programs, in the calculus of inductive constructions. First, we describe a formalization of the proof of first-order terms unification: this proof is obtained from a similar proof ...
Comments