Take a look at the new version of this page: [ beta version ]. Tell us what you think.

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.

REFERENCES

• 1: Krzysztof R. Apt , M. H. van Emden, Contributions to the Theory of Logic Programming, Journal of the ACM (JACM), v.29 n.3, p.841-862, July 1982 [doi>10.1145/322326.322339]
• 2: Boyer R.S. (1971) Locking: a Restriction of Resolution, Ph.D. Thesis, University of Texas at Austin, Texas.
• 3: Ivan Bratko, Prolog programming for artificial intelligence, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 4: Chin-Liang Chang , Richard Char-Tung Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, Inc., Orlando, FL, 1997
• 5: Jacques Cohen, A view of the origins and development of Prolog, Communications of the ACM, v.31 n.1, p.26-36, Jan. 1988 [doi>10.1145/35043.35045]
• 6: 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.
• 7: Colmerauer A (1983) Prolog en 10 Figures, Rapport de Recherche, Groupe Intelligence Artificial, Universite d'Aix-Marseille.
• 8: E. W. Elcock, ABSYS: the first logic programming language—a retrospective and commentary, Journal of Logic Programming, v.9 n.1, p.1-17, Jul. 1990 [doi>10.1016/0743-1066(90)90030-9]
• 9: David Harel, On folk theorems, Communications of the ACM, v.23 n.7, p.379-389, July 1980 [doi>10.1145/358886.358892]
• 10: Hewitt C. (1969) Planner: A language for Proving Theorems in Robots, Proc. IJCAI, Washington, 1969, p. 295-301.
• 11: Hill R. (1974), LUSH-Resolution and its Completeness, DCL Memo 78, Dept. of AI, U. Edinburgh.
• 12: Kowalski R.A. and Kuehner D. (1971), Linear Resolution with Selection Function, Artificial Intelligence, 2, 227-60.
• 13: Kowalski R.A. (1974) Predicate Logic as a Programming Language, Proc IFIP 74, North Holland, p. 569-74.
• 14: Robert A. Kowalski, The early years of logic programming, Communications of the ACM, v.31 n.1, p.38-43, Jan. 1988 [doi>10.1145/35043.35046]
• 15: Kuehner D. (1972) Some Special Purpose Resolution Systems, Machine Intelligence 7, Edinburgh University Press, 117-128.
• 16: J. W. Lloyd, Foundations of logic programming, Springer-Verlag New York, Inc., New York, NY, 1984
• 17: Raymond Reiter, Two Results on Ordering for Resolution with Merging and Linear Format, Journal of the ACM (JACM), v.18 n.4, p.630-646, Oct. 1971 [doi>10.1145/321662.321678]
• 18: Robinson J.A. (1983) Logic Programming: past, present and future, Tech Rept TR- 015, ICOT, Tokyo.
• 19: 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.
• 20: Sterling L. and Shapiro E. (1986), The Art of Prolog, MIT Press.
• 21: van Emden M.H. [1977], Programming in Resolution Logic, Machine Intelligence 8, p. 266-99.

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.2 HISTORY OF COMPUTING
      Subjects: Software

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Logic and constraint programming

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.3 Deduction and Theorem Proving
          Subjects: Logic programming

General Terms:
Languages, Theory