Prolog
Ng> 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) N="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 - (15369 Reads) |
