Prolog
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) Yle="border-width:thin; border-color:#333333; border-stYle:dashed; padding:5px;" align="left">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 ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (15678 Reads) |
