<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 {Darmstadt, Germany (ftp://ftp.th-darmstadt.de/pub/programming/languages/prolog/standard/)}. or UGA, USA . See also negation by failure, Kamin' s interpreters, Paradigms of AI programming, Aditi. A prolog interpreter in Scheme. . {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)

In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ Aditi ] [ af ] [ ag ] [ AI ] [ ai ] [ AL ] [ al ] [ ALGOL ] [ AM ] [ am ] [ an ] [ ar ] [ arc ] [ artificial intelligence ] [ as ] [ at ] [ au ] [ B ] [ b ] [ ba ] [ backtracking ] [ base ] [ be ] [ bo ] [ built-in ] [ by ] [ C ] [ ca ] [ cat ] [ ch ] [ ci ] [ ck ] [ cl ] [ co ] [ com ] [ con ] [ continuation ] [ continuations ] [ control ] [ control structure ] [ C-prolog ] [ D ] [ Darms ] [ de ] [ depth-first search ] [ design ] [ DP ] [ du ] [ E ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ er ] [ era ] [ es ] [ ESL ] [ ESLPDprO ] [ et ] [ failure ] [ feature ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ Frolic ] [ function ] [ G ] [ GA ] [ ga ] [ ge ] [ gen ] [ German ] [ gh ] [ gi ] [ gm ] [ gn ] [ goal ] [ GOL ] [ gr ] [ gs ] [ gu ] [ h ] [ hm ] [ hr ] [ hu ] [ IC ] [ id ] [ il ] [ in ] [ inc ] [ include ] [ int ] [ interpreter ] [ io ] [ iq ] [ ir ] [ IS ] [ is ] [ ISO ] [ it ] [ K ] [ Kamin' s interpreters ] [ ki ] [ la ] [ language ] [ Lex ] [ LG ] [ li ] [ LM-prolog ] [ logic programming ] [ ls ] [ lt ] [ lu ] [ ly ] [ M ] [ ma ] [ man ] [ Mars ] [ Mel ] [ mil ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ M-prolog ] [ ms ] [ MZ ] [ N ] [ na ] [ nc ] [ ne ] [ negation by failure ] [ ng ] [ ni ] [ no ] [ ns ] [ nu ] [ O ] [ om ] [ Open prolog ] [ pa ] [ Paradigms of AI programming ] [ PD ] [ PDP ] [ pe ] [ ph ] [ pl ] [ PM ] [ pr ] [ pr ] [ process ] [ processing ] [ program ] [ programming ] [ pt ] [ Q ] [ query ] [ Quintus prolog ] [ rc ] [ re ] [ resolution ] [ rete ] [ rl ] [ ro ] [ ru ] [ S ] [ SA ] [ SB-prolog ] [ sc ] [ Scheme ] [ se ] [ sh ] [ SI ] [ si ] [ SICS ] [ sig ] [ sit ] [ sk ] [ SL ] [ SNI ] [ SO ] [ so ] [ solution ] [ st ] [ standard ] [ struct ] [ T ] [ tar ] [ th ] [ tp ] [ tr ] [ track ] [ tracking ] [ tw ] [ ua ] [ ug ] [ unification ] [ UPMAIL Tricia prolog ] [ US ] [ us ] [ user ] [ va ] [ ve ] [ version ] [ vi ] [ ye ] [ Z ]