An implementation of Edinburgh Prolog by Nick Henfrey, ESL. ["An Advanced Logic Programming Language", Anthony Dodd].

PROgramming in LOGic

<programming> Programming in Logic or (French) Programmation en Logique. The first of the huge family of {logic programming} languages. Prolog was invented by Alain Colmerauer and Phillipe Roussel at the University of Aix-Marseille in 1971. It was first implemented 1972 in ALGOL-W. It was designed originally for natural-language processing but has become one of the most widely used languages for artificial intelligence. It is based on LUSH (or SLD) resolution {theorem proving} and unification. The first versions had no user-defined functions and no control structure other than the built-in depth-first search with backtracking. Early collaboration between Marseille and Robert Kowalski at University of Edinburgh continued until about 1975. Early implementations included C-Prolog, ESLPDPRO, Frolic, LM-Prolog, Open Prolog, SB-Prolog, {UPMAIL Tricia Prolog}. In 1998, the most common Prologs in use are Quintus Prolog, SICSTUS Prolog, LPA Prolog, {SWI Prolog}, AMZI Prolog, SNI Prolog. ISO draft standard at {prolog/standard/">Darmstadt, Germany (ftp://ftp.th-darmstadt.de/pub/programming/languages/prolog/standard/)}. or UGA, USA (ftp://ai.uga.edu/ai.prolog.standard). See also negation by failure, Kamin's interpreters, Paradigms of AI Programming, Aditi. A Prolog interpreter in Scheme. ftp://cpsc.ucalgary.ca/pub/prolog1.1. {A Prolog package (ftp://cpsc.ucalgary.ca/pub/prolog1.1/prolog11.tar.Z)} from the University of Calgary features delayed goals and interval arithmetic. It requires Scheme with continuations. ["Programming in Prolog", W.F. Clocksin & C.S. Mellish, Springer, 1985]. (2001-04-01)

A Prolog from the SICS (Swedish Inst of Comp Sci). E-mail: <sicstus-request@sics.se>. Mailing list: sicstus-users@sics.se. (1995-01-05)

<language> An extension of standard Prolog defined by Dale A. Miller and Gopalan Nadathur in 1986, in which terms are strongly typed lambda terms. Clauses are higher order hereditary Harrop formulas. The main novelties are universal quantification on goals and implication. The Prolog/Mali compiler compiles Lambda Prolog for the MALI abstract memory system. Teyjus (http://teyjus.cs.umn.edu/) is an implementation of Lambda Prolog. Lambda Prolog home (http://cse.psu.edu/Lambda Prologdale/lProlog/). Mailing list: lprolog@cs.umn.edu. ["Higher-order logic programming", Miller D.A. and Nadathur G., 3rd International Conference on Logic Programming, pp 448-462, London 1986]. [Nadathur G. "A Higher-Order Logic as a Basis for Logic Programming", Thesis, University of Pennsylvania, 1987]. (2002-10-15)

A strongly typed Prolog-like logic programming language. 1986. It has user-defined domains. Programs are arranged in sections: DOMAINS, CLAUSES, PREDICATES, DATABASE and GOAL. It is currently known as PDC Prolog and is distributed by Prolog Development Center, Atlanta +1 404 873 1366. E-mail: <pdc@mcimail.com>.

<programming> A Prolog by Jan Wielemaker <jan@swi.psy.uva.nl> like a superset of Edinburgh Prolog. Version 1.7.2. Docking Station is distributed under {General Public License}. It runs on Sun-4, Sun-3, Linux, DEC MIPS (incomplete), RS/6000, PS2/AIX, Atari ST, Gould PN, NeXT, VAX, HP-UX (problems), MS-DOS, and OS/2. Prolog">ftp://swi.psy.uva.nl/pub/SWI-Prolog. OS/2 (ftp://mpii02999.ag2.mpi-sb.mpg.de/pub/toolw/SWI/). Mailing list: prolog-request@swi.psy.uva.nl. (2000-03-23)

Under the Whyte notation for the classification of steam locomotives, 2-2-2-2 could represent either the wheel arrangement of two leading wheels, four powered but uncoupled driving wheels, and two trailing wheels; or of two independent leading axles (not in a bogie truck), two driving wheels, and two trailing wheels.