@prefix dbpprop: .
@prefix dbpedia: .
dbpprop:influencedBy dbpedia:Prolog ,
dbpedia:Prolog ;
dbpprop:influenced dbpedia:Prolog ;
dbpprop:influencedBy dbpedia:Prolog .
@prefix rdf: .
@prefix opencyc: .
dbpedia:Prolog rdf:type opencyc:Mx4r1rZxZHS-EdaAAACgyZzFrg ,
opencyc:Mx4rvVjC6pwpEbGdrcN5Y29ycA .
@prefix owl: .
dbpedia:Prolog owl:sameAs ,
opencyc:Mx4rvVi4pZwpEbGdrcN5Y29ycA .
@prefix foaf: .
@prefix ns6: .
dbpedia:Prolog foaf:page ns6:Prolog .
@prefix ns7: .
dbpedia:Prolog dbpprop:reference ns7:Prolog ,
,
,
,
,
,
,
,
,
,
.
@prefix rdfs: .
dbpedia:Prolog rdfs:label "Prolog"@pt ,
"Prolog (programovac\u00ED jazyk)"@cs ,
"Prolog (programmeringsspr\u00E5k)"@no ,
"Prolog"@ca ,
"Prolog (Programmiersprache)"@de ,
"Prolog"@fi ,
"Prolog"@tr ,
"Prolog"@es ,
"Prolog"@zh ,
"Prolog"@hu ,
"Prolog"@fr ,
"Prolog (j\u0119zyk programowania)"@pl ,
"Prolog (programmeringsspr\u00E5k)"@sv ,
"Prolog"@ja ,
"Prolog"@en ,
"Prolog"@it ,
"\u041F\u0440\u043E\u043B\u043E\u0433 (\u044F\u0437\u044B\u043A \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F)"@ru ,
"Prolog"@ro ,
"\u041F\u0440\u043E\u043B\u043E\u0433 (\u043C\u043E\u0432\u0430 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F)"@uk ,
"Prolog"@nl ;
dbpprop:abstract "Prolog este un limbaj specific inteligen\u0163ei artificiale (Prolog - Programming in Logic) Originea lui apar\u0163ine lui Alain Calmaureur de la Universitatea din Marsilia, Fran\u0163a. Ini\u0163ial a fost conceput pentru analiza lexical\u0103. Azi in mod curent exista mai multe implement\u0103ri at\u00E2t open source c\u00E2t \u015Fi proprietare. Printre cele mai bune implementari open source existente azi se numara swi-prolog."@ro ,
"Prolog est l\u2019un des principaux langages de programmation logique. Le nom Prolog est un acronyme de PROgrammation LOGique. Il a \u00E9t\u00E9 cr\u00E9\u00E9 par Alain Colmerauer et Philippe Roussel vers 1972. Le but \u00E9tait de faire un langage de programmation qui permettait d'utiliser l'expressivit\u00E9 de la logique au lieu de d\u00E9finir pas \u00E0 pas la succession d'instructions que doit ex\u00E9cuter un ordinateur. Prolog est utilis\u00E9 dans de nombreux programmes d\u2019intelligence artificielle et dans le traitement de la linguistique par ordinateur (surtout ceux concernant les langages naturels). Sa syntaxe et sa s\u00E9mantique sont consid\u00E9r\u00E9es comme tr\u00E8s simples et claires (le but original \u00E9tait de procurer un outil pour les linguistes ignorant l\u2019informatique). Beaucoup de recherches menant \u00E0 l\u2019impl\u00E9mentation actuelle de Prolog vinrent des effets du projet pour les ordinateurs de la cinqui\u00E8me g\u00E9n\u00E9ration qui utilisaient comme base une variante. Prolog est bas\u00E9 sur le calcul des pr\u00E9dicats du premier ordre; cependant il est restreint dans sa version initiale \u00E0 n\u2019accepter que les clauses de Horn (les versions modernes de Prolog acceptent des pr\u00E9dicats plus complexes, notamment avec le traitement de la n\u00E9gation par l'\u00E9chec). L\u2019ex\u00E9cution d\u2019un programme Prolog est effectivement une application du th\u00E9or\u00E8me prouvant par r\u00E9solution du premier ordre. Les concepts fondamentaux sont l\u2019unification, la r\u00E9cursivit\u00E9 et le retour sur trace. L'algorithme de r\u00E9solution de Prolog est bas\u00E9 sur une extension de la SLD-r\u00E9solution. Une des particularit\u00E9s de Prolog est que l'on peut construire une base de connaissances dans un ordre ind\u00E9termin\u00E9. Prolog peut ensuite r\u00E9soudre des s\u00E9ries de probl\u00E8mes logiques relatifs \u00E0 une telle base de connaissances (notion base de donn\u00E9es d\u00E9ductive)."@fr ,
"Prolog\uFF08\u30D7\u30ED\u30ED\u30FC\u30B0\u3001\u30D7\u30ED\u30ED\u30B0\uFF09\u306F\u975E\u624B\u7D9A\u304D\u578B\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u8A00\u8A9E\u306E\u4E00\u3064\u3002\u8AD6\u7406\u578B\u8A00\u8A9E\u306B\u5206\u985E\u3055\u308C\u308B\u3002\u540D\u79F0\u306FProgramming in Logic \u306E\u7565\u3002 1972\u5E74\u3054\u308D\u306B\u30D5\u30E9\u30F3\u30B9\u306E\u30AB\u30EB\u30E1\u30E9\u30A6\u30A2\u30FC\u3068\u30B3\u30EF\u30EB\u30B9\u30AD\u30FC\u306B\u3088\u3063\u3066\u8003\u6848\u3055\u308C\u305F\u3002\u30D7\u30ED\u30B0\u30E9\u30E0\u306F\u4E00\u968E\u8FF0\u8A9E\u8AD6\u7406\u306B\u57FA\u3065\u3044\u3066\u30C7\u30FC\u30BF\u9593\u306E\u95A2\u4FC2\u3092\u793A\u3059\u547D\u984C\u3068\u3057\u3066\u8A18\u8FF0\u3055\u308C\u3001\u51E6\u7406\u7CFB\u304C\u305D\u308C\u3089\u306B\u30D1\u30BF\u30FC\u30F3\u30DE\u30C3\u30C1\u30F3\u30B0\uFF08\u30E6\u30CB\u30D5\u30A3\u30B1\u30FC\u30B7\u30E7\u30F3\uFF09\u3092\u65BD\u3057\u306A\u304C\u3089\u3001\u4E0E\u3048\u3089\u308C\u305F\u547D\u984C\u304C\u6210\u7ACB\u3059\u308B\u304B\u518D\u5E30\u7684\u624B\u7D9A\u304D\u306B\u3088\u3063\u3066\u63A2\u7D22\u3059\u308B\u3002 \u4EBA\u5DE5\u77E5\u80FD\u306B\u304A\u3051\u308B\u30C8\u30C3\u30D7\u30FB\u30C0\u30A6\u30F3\u5F0F\u306E\u554F\u984C\u89E3\u6C7A\u3068\u76F8\u6027\u304C\u826F\u3044\u305F\u3081\u306B\u3001\u4EBA\u5DE5\u77E5\u80FD\u7814\u7A76\u3068\u30A8\u30AD\u30B9\u30D1\u30FC\u30C8\u30B7\u30B9\u30C6\u30E0\u306E\u5B9F\u73FE\u306E\u305F\u3081\u306E\u4E3B\u8981\u8A00\u8A9E\u3068\u3057\u3066\u5E83\u304F\u63A1\u7528\u3055\u308C\u305F\u3002 Prolog\u306E\u3082\u3068\u3068\u306A\u308B\u6F14\u7E79\u624B\u6CD5\u306F\u5C0E\u51FA\u3068\u547C\u3070\u308C\u3001\u81EA\u52D5\u5B9A\u7406\u8A3C\u660E\u306E\u7814\u7A76\u306B\u304A\u3044\u3066Prolog\u958B\u767A\u4EE5\u524D\u3088\u308A\u3088\u304F\u77E5\u3089\u308C\u3066\u3044\u305F\u3002Prolog\u306F\u3001\u5C0E\u51FA\u306B\u304A\u3044\u3066\u7BC0\u3092\u4EE5\u4E0B\u306B\u8FF0\u3079\u308B\u982D\u90E8\u304C\u4E00\u3064\u306E\u547D\u984C\u304B\u3089\u306E\u307F\u306A\u308B\u30DB\u30FC\u30F3\u7BC0\u306B\u9650\u5B9A\u3057\u305F\u3082\u306E\u3068\u3068\u3089\u3048\u308B\u4E8B\u304C\u51FA\u6765\u308B\u3002\u3000"@ja ,
"Prolog ist eine Programmiersprache, die Anfang der 1970er Jahre ma\u00DFgeblich von dem franz\u00F6sischen Informatiker Alain Colmerauer entwickelt wurde und ein deklaratives Programmieren erm\u00F6glicht. Sie ist die wichtigste logische Programmiersprache. Erste Implementierungen wichen in ihrer Syntax stark voneinander ab, aber der Edinburgh-Dialekt setzte sich bald als Quasistandard durch. Er war jedoch nicht formal definiert, bis er 1995 zur Grundlage eines ISO-Standards wurde (ISO/IEC 13211-1), der auch ISO-Prolog genannt wird. Der erste Prolog-Interpreter wurde in Marseille in ALGOL W realisiert. Der erste Compiler wurde von David H. D. Warren in Edinburgh entwickelt. Dieser hatte als Zielsprache die des Logik-Prozessors Warren's Abstract Machine, was heute noch f\u00FCr die meisten Prolog-Compiler der Fall ist."@de ,
"\u041F\u0440\u043E\u043B\u043E\u0433\u00A0\u2014 \u044F\u0437\u044B\u043A \u0438 \u0441\u0438\u0441\u0442\u0435\u043C\u0430 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F, \u043E\u0441\u043D\u043E\u0432\u0430\u043D\u043D\u044B\u0435 \u043D\u0430 \u044F\u0437\u044B\u043A\u0435 \u043F\u0440\u0435\u0434\u0438\u043A\u0430\u0442\u043E\u0432 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u0435\u0441\u043A\u043E\u0439 \u043B\u043E\u0433\u0438\u043A\u0438 \u0434\u0438\u0437\u044A\u044E\u043D\u043A\u0442\u043E\u0432 \u0425\u043E\u0440\u043D\u0430, \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u044F\u044E\u0449\u0435\u0439 \u0441\u043E\u0431\u043E\u0439 \u043F\u043E\u0434\u043C\u043D\u043E\u0436\u0435\u0441\u0442\u0432\u043E \u043B\u043E\u0433\u0438\u043A\u0438 \u043F\u0440\u0435\u0434\u0438\u043A\u0430\u0442\u043E\u0432 \u043F\u0435\u0440\u0432\u043E\u0433\u043E \u043F\u043E\u0440\u044F\u0434\u043A\u0430. \u041E\u0441\u043D\u043E\u0432\u043D\u044B\u043C\u0438 \u043F\u043E\u043D\u044F\u0442\u0438\u044F\u043C\u0438 \u0432 \u044F\u0437\u044B\u043A\u0435 \u041F\u0440\u043E\u043B\u043E\u0433 \u044F\u0432\u043B\u044F\u044E\u0442\u0441\u044F \u0444\u0430\u043A\u0442\u044B, \u043F\u0440\u0430\u0432\u0438\u043B\u0430 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u0432\u044B\u0432\u043E\u0434\u0430 \u0438 \u0437\u0430\u043F\u0440\u043E\u0441\u044B, \u043F\u043E\u0437\u0432\u043E\u043B\u044F\u044E\u0449\u0438\u0435 \u043E\u043F\u0438\u0441\u044B\u0432\u0430\u0442\u044C \u0431\u0430\u0437\u044B \u0437\u043D\u0430\u043D\u0438\u0439, \u043F\u0440\u043E\u0446\u0435\u0434\u0443\u0440\u044B \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u0432\u044B\u0432\u043E\u0434\u0430 \u0438 \u043F\u0440\u0438\u043D\u044F\u0442\u0438\u044F \u0440\u0435\u0448\u0435\u043D\u0438\u0439. \u0424\u0430\u043A\u0442\u044B \u0432 \u044F\u0437\u044B\u043A\u0435 \u041F\u0440\u043E\u043B\u043E\u0433 \u043E\u043F\u0438\u0441\u044B\u0432\u0430\u044E\u0442\u0441\u044F \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u0438\u043C\u0438 \u043F\u0440\u0435\u0434\u0438\u043A\u0430\u0442\u0430\u043C\u0438 \u0441 \u043A\u043E\u043D\u043A\u0440\u0435\u0442\u043D\u044B\u043C\u0438 \u0437\u043D\u0430\u0447\u0435\u043D\u0438\u044F\u043C\u0438. \u041F\u0440\u0430\u0432\u0438\u043B\u0430 \u0432 \u041F\u0440\u043E\u043B\u043E\u0433\u0435 \u0437\u0430\u043F\u0438\u0441\u044B\u0432\u0430\u044E\u0442\u0441\u044F \u0432 \u0444\u043E\u0440\u043C\u0435 \u043F\u0440\u0430\u0432\u0438\u043B \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u0432\u044B\u0432\u043E\u0434\u0430 \u0441 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u0438\u043C\u0438 \u0437\u0430\u043A\u043B\u044E\u0447\u0435\u043D\u0438\u044F\u043C\u0438 \u0438 \u0441\u043F\u0438\u0441\u043A\u043E\u043C \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u0438\u0445 \u0443\u0441\u043B\u043E\u0432\u0438\u0439. \u041E\u0441\u043E\u0431\u0443\u044E \u0440\u043E\u043B\u044C \u0432 \u0438\u043D\u0442\u0435\u0440\u043F\u0440\u0435\u0442\u0430\u0442\u043E\u0440\u0435 \u041F\u0440\u043E\u043B\u043E\u0433\u0430 \u0438\u0433\u0440\u0430\u044E\u0442 \u043A\u043E\u043D\u043A\u0440\u0435\u0442\u043D\u044B\u0435 \u0437\u0430\u043F\u0440\u043E\u0441\u044B \u043A \u0431\u0430\u0437\u0430\u043C \u0437\u043D\u0430\u043D\u0438\u0439, \u043D\u0430 \u043A\u043E\u0442\u043E\u0440\u044B\u0435 \u0441\u0438\u0441\u0442\u0435\u043C\u0430 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F \u0433\u0435\u043D\u0435\u0440\u0438\u0440\u0443\u0435\u0442 \u043E\u0442\u0432\u0435\u0442\u044B \u00AB\u0438\u0441\u0442\u0438\u043D\u0430\u00BB \u0438 \u00AB\u043B\u043E\u0436\u044C\u00BB. \u0414\u043B\u044F \u043E\u0431\u043E\u0431\u0449\u0435\u043D\u043D\u044B\u0445 \u0437\u0430\u043F\u0440\u043E\u0441\u043E\u0432 \u0441 \u043F\u0435\u0440\u0435\u043C\u0435\u043D\u043D\u044B\u043C\u0438 \u0432 \u043A\u0430\u0447\u0435\u0441\u0442\u0432\u0435 \u0430\u0440\u0433\u0443\u043C\u0435\u043D\u0442\u043E\u0432 \u0441\u043E\u0437\u0434\u0430\u043D\u043D\u0430\u044F \u0441\u0438\u0441\u0442\u0435\u043C \u041F\u0440\u043E\u043B\u043E\u0433 \u0432\u044B\u0432\u043E\u0434\u0438\u0442 \u043A\u043E\u043D\u043A\u0440\u0435\u0442\u043D\u044B\u0435 \u0434\u0430\u043D\u043D\u044B\u0435 \u0432 \u043F\u043E\u0434\u0442\u0432\u0435\u0440\u0436\u0434\u0435\u043D\u0438\u0435 \u0438\u0441\u0442\u0438\u043D\u043D\u043E\u0441\u0442\u0438 \u043E\u0431\u043E\u0431\u0449\u0435\u043D\u043D\u044B\u0445 \u0441\u0432\u0435\u0434\u0435\u043D\u0438\u0439 \u0438 \u043F\u0440\u0430\u0432\u0438\u043B \u0432\u044B\u0432\u043E\u0434\u0430. \u0424\u0430\u043A\u0442\u044B \u0432 \u0431\u0430\u0437\u0430\u0445 \u0437\u043D\u0430\u043D\u0438\u0439 \u043D\u0430 \u044F\u0437\u044B\u043A\u0435 \u041F\u0440\u043E\u043B\u043E\u0433 \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u044F\u044E\u0442 \u043A\u043E\u043D\u043A\u0440\u0435\u0442\u043D\u044B\u0435 \u0441\u0432\u0435\u0434\u0435\u043D\u0438\u044F (\u0437\u043D\u0430\u043D\u0438\u044F). \u041E\u0431\u043E\u0431\u0449\u0451\u043D\u043D\u044B\u0435 \u0441\u0432\u0435\u0434\u0435\u043D\u0438\u044F \u0438 \u0437\u043D\u0430\u043D\u0438\u044F \u0432 \u044F\u0437\u044B\u043A\u0435 \u041F\u0440\u043E\u043B\u043E\u0433 \u0437\u0430\u0434\u0430\u044E\u0442\u0441\u044F \u043F\u0440\u0430\u0432\u0438\u043B\u0430\u043C\u0438 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u0432\u044B\u0432\u043E\u0434\u0430 (\u043E\u043F\u0440\u0435\u0434\u0435\u043B\u0435\u043D\u0438\u044F\u043C\u0438) \u0438 \u043D\u0430\u0431\u043E\u0440\u0430\u043C\u0438 \u0442\u0430\u043A\u0438\u0445 \u043F\u0440\u0430\u0432\u0438\u043B \u0432\u044B\u0432\u043E\u0434\u0430 (\u043E\u043F\u0440\u0435\u0434\u0435\u043B\u0435\u043D\u0438\u0439) \u043D\u0430\u0434 \u043A\u043E\u043D\u043A\u0440\u0435\u0442\u043D\u044B\u043C\u0438 \u0444\u0430\u043A\u0442\u0430\u043C\u0438 \u0438 \u043E\u0431\u043E\u0431\u0449\u0435\u043D\u043D\u044B\u043C\u0438 \u0441\u0432\u0435\u0434\u0435\u043D\u0438\u044F\u043C\u0438. \u041D\u0430\u0447\u0430\u043B\u043E \u0438\u0441\u0442\u043E\u0440\u0438\u0438 \u044F\u0437\u044B\u043A\u0430 \u043E\u0442\u043D\u043E\u0441\u0438\u0442\u0441\u044F \u043A 1970-\u043C \u0433\u043E\u0434\u0430\u043C. \u0411\u0443\u0434\u0443\u0447\u0438 \u0434\u0435\u043A\u043B\u0430\u0440\u0430\u0442\u0438\u0432\u043D\u044B\u043C \u044F\u0437\u044B\u043A\u043E\u043C \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F, \u041F\u0440\u043E\u043B\u043E\u0433 \u0432\u043E\u0441\u043F\u0440\u0438\u043D\u0438\u043C\u0430\u0435\u0442 \u0432 \u043A\u0430\u0447\u0435\u0441\u0442\u0432\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u044B \u043D\u0435\u043A\u043E\u0442\u043E\u0440\u043E\u0435 \u043E\u043F\u0438\u0441\u0430\u043D\u0438\u0435 \u0437\u0430\u0434\u0430\u0447\u0438 \u0438\u043B\u0438 \u0431\u0430\u0437 \u0437\u043D\u0430\u043D\u0438\u0439, \u0438 \u0441\u0430\u043C \u043F\u0440\u043E\u0438\u0437\u0432\u043E\u0434\u0438\u0442 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u0438\u0439 \u0432\u044B\u0432\u043E\u0434, \u0430 \u0442\u0430\u043A\u0436\u0435 \u043F\u043E\u0438\u0441\u043A \u0440\u0435\u0448\u0435\u043D\u0438\u044F \u0437\u0430\u0434\u0430\u0447, \u043F\u043E\u043B\u044C\u0437\u0443\u044F\u0441\u044C \u043C\u0435\u0445\u0430\u043D\u0438\u0437\u043C\u043E\u043C \u0431\u044D\u043A\u0442\u0440\u0435\u043A\u0438\u043D\u0433\u0430 \u0438 \u0443\u043D\u0438\u0444\u0438\u043A\u0430\u0446\u0438\u0435\u0439."@ru ,
"Il Prolog (PROgrammation en LOGique) \u00E8 un linguaggio di programmazione che adotta il paradigma di programmazione logica. \u00C8 stato ideato da Robert Kowalski (aspetto teorico), Marten Van Emdem (dimostrazione sperimentale), ed implementato da Alain Colmerauer negli anni 70, costituendo un tentativo di costruire un linguaggio di programmazione che consentisse l'espressione del problema in forma logica invece della traduzione di un algoritmo di soluzione in forma di istruzioni da eseguire da parte della macchina. L'attuale implementazione di Prolog \u00E8 dovuta in gran parte all'efficiente codifica di David H.D. Warren, implementata tramite la sua Warren Abstract Machine. Il Prolog \u00E8 impiegato in molti programmi di intelligenza artificiale, la sua sintassi e la semantica sono molto semplici e chiare (lo scopo primitivo era quello di fornire uno strumento di lavoro a linguisti privi di conoscenze informatiche). Il Prolog si basa sul calcolo dei predicati (precisamente il calcolo di predicati del primo ordine); tuttavia la sintassi \u00E8 limitata a formule dette clausole di Horn che sono disgiunzioni di letterali del primo ordine quantificate universalmente con al pi\u00F9 un letterale positivo. L'esecuzione di un programma Prolog \u00E8 comparabile alla dimostrazione di un teorema mediante la regola di inferenza detta risoluzione. I concetti fondamentali sono l'unificazione, la ricorsione in coda e il backtracking."@it ,
"Prolog (Fr. programmation en logique, \"programmeren met logica\") is een logische programmeertaal die ontworpen werd door Robert Kowalski en Alain Colmerauer aan de universiteit van Marseille in het jaar 1973. De taal heeft een sterk logisch en declaratief karakter: feiten en relaties worden gedeclareerd in een eenvoudig soort database die bevraagd kan worden."@nl ,
"El Prolog (o PROLOG), proveniente del franc\u00E9s PROgrammation en LOGique, es un lenguaje de programaci\u00F3n l\u00F3gico e interpretado, bastante conocido en el medio de investigaci\u00F3n en Inteligencia Artificial."@es ,
"Prolog is a logic programming general purpose fifth generation language associated with artificial intelligence and computational linguistics. It has a purely logical subset, called \"pure Prolog\", as well as a number of extralogical features. Prolog has its roots in formal logic, and unlike many other programming languages, Prolog is declarative: The program logic is expressed in terms of relations, and execution is triggered by running queries over these relations. Relations and queries are constructed using Prolog's single data type, the term. Relations are defined by clauses. Given a query, the Prolog engine attempts to find a resolution refutation of the negated query. If the negated query can be refuted, i.e. , an instantiation for all free variables is found that makes the union of clauses and the singleton set consisting of the negated query false, it follows that the original query, with the found instantiation applied, is a logical consequence of the program. This makes Prolog (and other logic programming languages) particularly useful for database, symbolic mathematics, and language parsing applications. Because Prolog allows impure predicates, checking the truth value of certain special predicates may have some deliberate side effect, such as printing a value to the screen. This permits the programmer to use some amount of conventional imperative programming when the logical paradigm is inconvenient. The language was first conceived by a group around Alain Colmerauer in Marseille, France, in the early 1970s. According to Robert Kowalski, the first Prolog system was developed in 1972 by Alain Colmerauer and Phillipe Roussel. The first implementations of Prolog were interpreters, however, David H. D. Warren created the Warren Abstract Machine, an early and influential Prolog compiler which came to define the \"Edinburgh Prolog\" dialect which served as the basis for the syntax of most modern implementations. Prolog was one of the first logic programming languages, and remains among the most popular such languages today, with many free and commercial implementations available. While initially aimed at natural language processing, the language has since then stretched far into other areas like theorem proving, expert systems, games, automated answering systems, ontologies and sophisticated control systems, and modern Prolog environments support the creation of graphical user interfaces, as well as administrative and networked applications. Subsequent extensions of Prolog by the original team introduced Constraint Logic Programming abilities into the implementations."@en ,
"Prolog, ett programspr\u00E5k f\u00F6r logikprogrammering. Prolog skiljer sig fr\u00E5n de flesta andra programspr\u00E5k i och med att det bygger p\u00E5 logiska uttryck och inte p\u00E5 instruktioner f\u00F6r datorn. Prolog anv\u00E4nds fr\u00E4mst inom omr\u00E5dena artificiell intelligens och spr\u00E5kbehandling. Att programmera i Prolog liknar inte riktigt program skrivna i programspr\u00E5k som t. ex C, spr\u00E5ket \u00E4r uppbyggt s\u00E5 att man i sitt program definierar klausuler som returnerar sant eller falskt. Man st\u00E4ller sedan fr\u00E5gor till systemet som med hj\u00E4lp av de klausuler man definierat kan dra slutsatser och svara p\u00E5 fr\u00E5gor."@sv ,
"A Prolog egy programoz\u00E1si nyelv, melyet Alain Colmerauer fejlesztett ki 1972-ben, a Prolog n\u00E9v a francia eredet\u0171 programmation en logique kifejez\u00E9s r\u00F6vid\u00EDt\u00E9se. Az els\u0151 logikai programoz\u00E1si nyelvnek tekinthet\u0151. A Prolog egy megadott logikai formul\u00E1r\u00F3l (c\u00E9lformula) k\u00E9pes eld\u00F6nteni, hogy logikai k\u00F6vetkezm\u00E9nye-e formul\u00E1k egy adott halmaz\u00E1nak. Ut\u00F3bbi formul\u00E1k \u00E9s a c\u00E9lformula a program bemenete, a kimenet pedig a v\u00E1lasz, hogy k\u00F6vetkezik-e a c\u00E9lformula a t\u00F6bbi formul\u00E1b\u00F3l. R\u00F6viddel Colmauer ut\u00E1n Szeredi P\u00E9ter is kifejlesztett egy Prolog interpretert Magyarorsz\u00E1gon."@hu ,
"\u041F\u0440\u043E\u043B\u043E\u0301\u0433 \u2014 \u043C\u043E\u0432\u0430 \u043B\u043E\u0433\u0456\u0447\u043D\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F. \u041F\u0440\u043E\u043B\u043E\u0433 \u0437\u0430\u0441\u043D\u043E\u0432\u0430\u043D\u0438\u0439 \u043D\u0430 \u0442\u0435\u043E\u0440\u0456\u0457 \u043F\u0440\u0435\u0434\u0438\u043A\u0430\u0442\u0456\u0432 \u043F\u0435\u0440\u0448\u043E\u0433\u043E \u043F\u043E\u0440\u044F\u0434\u043A\u0443. \u041D\u0430\u0437\u0432\u0430 \u043C\u043E\u0432\u0438 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0440\u043E\u0437\u0448\u0438\u0444\u0440\u043E\u0432\u0443\u0454\u0442\u044C\u0441\u044F \u044F\u043A (\u041F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0432 \u043B\u043E\u0433\u0456\u0446\u0456). \u0406\u0434\u0435\u044F \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u0430\u043D\u043D\u044F \u043C\u043E\u0436\u043B\u0438\u0432\u043E\u0441\u0442\u0435\u0439 \u043D\u0430\u0432\u0435\u0434\u0435\u043D\u043D\u044F \u0442\u0435\u043E\u0440\u0456\u0457 \u043F\u0440\u0435\u0434\u0438\u043A\u0430\u0442\u0456\u0432 \u043F\u0435\u0440\u0448\u043E\u0433\u043E \u043F\u043E\u0440\u044F\u0434\u043A\u0443 \u2014 \u043E\u0434\u043D\u0430 \u0437 \u0433\u043E\u043B\u043E\u0432\u043D\u0438\u0445 \u043F\u0435\u0440\u0435\u0432\u0430\u0433 \u043C\u043E\u0432\u0438 \u041F\u0440\u043E\u043B\u043E\u0433 \u0434\u043B\u044F \u043A\u043E\u043C\u043F'\u044E\u0442\u0435\u0440\u043D\u0438\u0445 \u043D\u0430\u0443\u043A \u0432\u0437\u0430\u0433\u0430\u043B\u0456 \u0442\u0430 \u0448\u0442\u0443\u0447\u043D\u043E\u0433\u043E \u0456\u043D\u0442\u0435\u043B\u0435\u043A\u0442\u0443."@uk ,
"Prolog \u00E9 uma linguagem de programa\u00E7\u00E3o que se enquadra no paradigma de Programa\u00E7\u00E3o em L\u00F3gica Matem\u00E1tica. \u00C9 uma linguagem de uso geral que \u00E9 especialmente associada com a intelig\u00EAncia artificial e ling\u00FC\u00EDstica computacional. Consiste numa linguagem puramente l\u00F3gica, que pode ser chamada de Prolog puro, e numa linguagem concreta, a qual acrescenta o Prolog puro com componentes extra-l\u00F3gicos. O uso Prolog puro foi originalmente restrito em provas do teorema da resolu\u00E7\u00E3o com Cl\u00E1usulas de Horn do formato H :- B1, \u2026, Bn.. A aplica\u00E7\u00E3o do provador de teoremas trata estas cl\u00E1usulas como procedimentos para mostrar/resolver H, mostrar/resolver B1 and \u2026 and Bn. O Prolog puro foi ent\u00E3o estendido para incluir a nega\u00E7\u00E3o por falha, na qual condi\u00E7\u00F5es negativas da forma not(Bi) s\u00E3o mostradas por tentativa e falha para resolver as condi\u00E7\u00F5es positivas correspondentes Bi). O nome Prolog para a linguagem concreta foi escolhido por Philippe Roussel como uma abrevia\u00E7\u00E3o de \u201CPROgrammation en LOGique\u201D. Foi criada em meados de 1972 por Alain Colmerauer e Philippe Roussel, baseados no conceito de Robert Kowalski da interpreta\u00E7\u00E3o procedimental das cl\u00E1usulas de Horn. A motiva\u00E7\u00E3o para isso veio em parte da vontade de reconciliar o uso da l\u00F3gica como uma linguagem declarativa de representa\u00E7\u00E3o do conhecimento com a representa\u00E7\u00E3o procedimental do conhecimento, que era popular na Am\u00E9rica do Norte no final da d\u00E9cada de 1960 para in\u00EDcio de 1970. Muito do desenvolvimento moderno do Prolog veio dos projetos de computadores da quinta gera\u00E7\u00E3o (FGCS), que desenvolveu uma variante do Prolog chamada Kernel Language para seu primeiro sistema operacional. Apesar do longo tempo de desenvolvimento, Prolog ainda n\u00E3o \u00E9 uma linguagem port\u00E1vel, j\u00E1 que cada implementa\u00E7\u00E3o usa rotinas completamente diferentes e incompat\u00EDveis entre si. Por exemplo, um programa trivial que faz um loop de ler uma linha da console e escreve a mesma linha, terminando quando for entrada uma linha vazia, \u00E9 imposs\u00EDvel de ser escrito de forma que qualquer interpretador consiga rodar."@pt ,
"Prolog (od francuskiego Programmation en Logique) to j\u0119zyk programowania logicznego - program w Prologu to opis regu\u0142y wnioskowania oraz celu do kt\u00F3rego zmierzamy, a rola komputera polega na odpowiednim zastosowaniu regu\u0142 aby znale\u017A\u0107 rozwi\u0105zanie. Prolog zosta\u0142 stworzony w 1971 roku przez Alaina Colmeraurera i Phillipe'a Roussela. U\u017Cywany w wielu programach z zakresu sztucznej inteligencji. Prolog opiera si\u0119 o rachunek predykatowy pierwszego rz\u0119du, jednak ogranicza si\u0119 tylko do klauzul Horna."@pl ,
"Prolog (programming in logic) er et deklarativt programmeringsspr\u00E5k satt sammen av logiske slutninger. Det best\u00E5r b\u00E5de av et rent logisk spr\u00E5k og tilleggsfunksjoner som gj\u00F8r at man kan bruke programmeringsspr\u00E5ket til det meste, som for eksempel \u00E5 lage grafiske brukergrensesnitt. Spr\u00E5ket brukes mye innen kunstig intelligens. Eksempel: Vi kan deklarere en sannhet ved \u00E5 fortelle Prolog f\u00F8lgende: katt(tom). som er ekvivalent med katt(tom) :- true. Her er noen eksempler p\u00E5 sp\u00F8rringer vi kan sp\u00F8rre Prolog programtolkeren er tom en katt? ?- katt(tom). yes. Hvem er katter? ?- katt(X). X = tom; yes. Prolog er likt predikatlogikk p\u00E5 den m\u00E5ten at det er fult mulig \u00E5 direkte oversette de fleste predikatlogikk setninger ved \u00E5 bare erstatte operatorene i setningen med de ekvivalente operatorene til prolog."@no ,
"Mant\u0131k programlama dilidir. Yapay zeka uygulamalar\u0131nda kullan\u0131lan be\u015Finci nesil bilgisayar dili ailesindendir. 1970'li y\u0131llar\u0131n ba\u015Flar\u0131nda Fransa'n\u0131n Marseille Aix \u00DCniversitesi'nde Alain Colmerauer ve \u00E7al\u0131\u015Fma grubu taraf\u0131ndan icat edilmi\u015Ftir. Frans\u0131zca \"Programmation en Logique\" kelimesinden gelmektir. Mant\u0131\u011F\u0131n do\u011Frudan do\u011Fruya bir bilgisayar dili olarak kullan\u0131labilmesini sa\u011Flamak amac\u0131yla yap\u0131lan \u00E7al\u0131\u015Fmalar da 1980 y\u0131llar\u0131n\u0131n ba\u015Flar\u0131nda da yo\u011Funluk kazanm\u0131\u015Ft\u0131r. 1981 y\u0131l\u0131nda Japonlar be\u015Finci nesil bilgisayar projesini a\u00E7\u0131klamalar\u0131yla da konuya olan ilgi b\u00FCy\u00FCk bir \u00F6l\u00E7\u00FCde artm\u0131\u015Ft\u0131r. Prolog \u00FCzerine \u00E7e\u015Fitli ama\u00E7 ve seviyelerde bir\u00E7ok kitap yay\u0131nlanm\u0131\u015F ve dilin bir standard\u0131 olu\u015Fmu\u015Ftur. Bilgisayar\u0131n belirli bir problemi \u00E7\u00F6zebilmesi i\u00E7in kendisine problemle ve \u00E7\u00F6z\u00FCm yoluyla ilgili bilgi verilmesi gereklidir. Programlama dilleri arac\u0131l\u0131\u011F\u0131yla insan bilgisayarlarla ileti\u015Fim kurabilir. Prolog mant\u0131ksal ve sembolik d\u00FC\u015F\u00FCnmeye uygun yap\u0131s\u0131yla, problemin tan\u0131mlanmas\u0131 ve \u00E7\u00F6z\u00FCm\u00FC i\u00E7in gerekli y\u00F6ntemlerin geli\u015Ftirilmesi a\u015Famalar\u0131nda insano\u011Fluna yard\u0131mc\u0131 olan bir ara\u00E7t\u0131r. Bir \u00F6rnek verecek olursak Sokrat bir insand\u0131r ve T\u00FCm insanlar \u00F6l\u00FCml\u00FCd\u00FCr c\u00FCmlelerinden, Sokrat \u00F6l\u00FCml\u00FCd\u00FCr sonucuna var\u0131r\u0131z. \u015Eimdi bu basit mant\u0131k probleminin bir prolog program\u0131 olarak nas\u0131l ifade edilebilece\u011Fini g\u00F6relim. Problem \u00F6nce dilin iki \u00F6\u011Fesi olan, ger\u00E7ekler ve kurallar arac\u0131l\u0131\u011F\u0131yla tan\u0131mlan\u0131r. Ger\u00E7ekler, matematiksel aksiyomlar gibi, bir veya daha fazla nesne anas\u0131nda bulunan bir ili\u015Fkiyi veya bir nesneyle ilgili bir \u00F6zelli\u011Fi, deklare etmek i\u00E7in yaz\u0131lan Prolog t\u00FCmceleridir. \u00D6rne\u011Fin, Sokrat bir insand\u0131r t\u00FCmcesini bir Prolog ger\u00E7e\u011Fi olarak \u015F\u00F6yle yazabiliriz: insan(sokrat)."@tr ,
"Prolog je logick\u00FD programovac\u00ED jazyk. Pat\u0159\u00ED mezi tzv. deklarativn\u00ED programovac\u00ED jazyky, ve kter\u00FDch program\u00E1tor popisuje pouze c\u00EDl v\u00FDpo\u010Dtu, p\u0159i\u010Dem\u017E p\u0159esn\u00FD postup, jak\u00FDm se k v\u00FDsledku program dostane, je ponech\u00E1n na libov\u016Fli syst\u00E9mu. Prolog se sna\u017E\u00ED o pokud mo\u017Eno abstraktn\u00ED vyj\u00E1d\u0159en\u00ED fakt\u016F a logick\u00FDch vztah\u016F mezi nimi s potla\u010Den\u00EDm imperativn\u00ED slo\u017Eky. Prolog je vyu\u017E\u00EDv\u00E1n p\u0159edev\u0161\u00EDm v oboru um\u011Bl\u00E9 inteligence a v po\u010D\u00EDta\u010Dov\u00E9 lingvistice (obzvl\u00E1\u0161t\u011B zpracov\u00E1n\u00ED p\u0159irozen\u00E9ho jazyka, pro n\u011Bj\u017E byl p\u016Fvodn\u011B navr\u017Een). Syntaxe jazyka je velice jednoduch\u00E1 a snadno pou\u017Eiteln\u00E1 prav\u011B proto, \u017Ee byl p\u016Fvodn\u011B ur\u010Den pro po\u010D\u00EDta\u010Dov\u011B nep\u0159\u00EDli\u0161 gramotn\u00E9 lingvisty. Prolog je zalo\u017Een na predik\u00E1tov\u00E9 logice prvn\u00EDho \u0159\u00E1du; konkr\u00E9tn\u011B se omezuje na Hornovy klauzule. B\u011Bh programu je pak p\u0159edstavov\u00E1n aplikac\u00ED dokazovac\u00EDch technik na zadan\u00E9 klauzule. Z\u00E1kladn\u00EDmi vyu\u017E\u00EDvan\u00FDmi p\u0159\u00EDstupy jsou unifikace, rekurze a backtracking."@cs ,
"Prolog on tunnetuin logiikkaohjelmointikieli. Nimi Prolog on lyhenne ranskan kielen sanoista PROgrammation en LOGique, sananmukaisesti logiikkaohjelmointi. Kielen kehittiv\u00E4t vuonna 1972 Alan Colmerauer, Philippe Roussel ja Robert Kowalski vaihtoehdoksi LISPille. Logiikkaohjelmointikielen\u00E4 Prolog poikkeaa melkoisesti proseduraalisista \"tavallisista\" ohjelmointikielist\u00E4. Kielell\u00E4 tehdyt ohjelmat muodostuvat k\u00E4skyjen sijaan s\u00E4\u00E4nn\u00F6ist\u00E4 ja kyselyist\u00E4. Kyselyll\u00E4 pyrit\u00E4\u00E4n selvitt\u00E4m\u00E4\u00E4n, pystyt\u00E4\u00E4nk\u00F6 se johtamaan s\u00E4\u00E4nn\u00F6ist\u00E4 k\u00E4sin."@fi ,
"Prolog\uFF08Programming in Logic\u7684\u7F29\u5199\uFF09\u662F\u4E00\u79CD\u903B\u8F91\u7F16\u7A0B\u8BED\u8A00\u3002\u5B83\u5EFA\u7ACB\u5728\u903B\u8F91\u5B66\u7684\u7406\u8BBA\u57FA\u7840\u4E4B\u4E0A\uFF0C \u6700\u521D\u88AB\u8FD0\u7528\u4E8E\u81EA\u7136\u8BED\u8A00\u7B49\u7814\u7A76\u9886\u57DF\u3002\u73B0\u5728\u5B83\u5DF2\u5E7F\u6CDB\u7684\u5E94\u7528\u5728\u4EBA\u5DE5\u667A\u80FD\u7684\u7814\u7A76\u4E2D\uFF0C\u5B83\u53EF\u4EE5\u7528\u6765\u5EFA\u9020\u4E13\u5BB6\u7CFB\u7EDF\u3001\u81EA\u7136\u8BED\u8A00\u7406\u89E3\u3001\u667A\u80FD\u77E5\u8BC6\u5E93\u7B49\u3002"@zh ,
"El Prolog (nom provinent dels mots francesos programation i logique) \u00E9s un llenguatge de programaci\u00F3 bastant popular en el medi d'investigaci\u00F3 en intel\u00B7lig\u00E8ncia artificial. Es tracta d'un llenguatge de programaci\u00F3 ideat a principis dels anys 70 a la universitat d'Ais-Marsella pels professors Alain Colmerauer i Phillipe Roussel. Inicialment es tractava d'un llenguatge totalment interpretat fins que, a mitjans dels 70, David H.D. Warren va desenvolupar un compilador capa\u00E7 de traduir Prolog en un conjunt d'instruccions d'una m\u00E0quina abstracta denominada Warren Abstract Machine, o abreviadament, WAM. Des de llavors, Prolog \u00E9s un llenguatge semi-interpretat. El Prolog s'emmarca en el paradigma dels llenguatges declaratius, la qual cosa el diferencia enormement d'altres llenguatges m\u00E9s populars com Fortran, Pascal, C, etc. En aquests darrers llenguatges, les instruccions s'executen normalment en ordre seq\u00FCencial, \u00E9s a dir, una a continuaci\u00F3 d'una altra, en el mateix ordre en el qual estan escrites, que nom\u00E9s varia quan s'arriba a una instrucci\u00F3 de control (un bucle, una instrucci\u00F3 condicional o una transfer\u00E8ncia). Els programes en Prolog es composen de cl\u00E0usules de Horn, que constitueixen regles del tipus \"modus ponens\", \u00E9s a dir, \"Si de veritat l'antecedent, llavors \u00E9s veritat el conseq\u00FCent\". No obstant aix\u00F2, la forma d'escriure les cl\u00E0usules de Horn \u00E9s al contrari de l'habitual. Primer s'escriu el conseq\u00FCent i despr\u00E9s l'antecedent. L'antecedent pot ser una conjunci\u00F3 de condicions que es denomina seq\u00FC\u00E8ncia d'objectius. Cada objectiu se separa amb una coma i pot considerar-se similar a una instrucci\u00F3 o crida a procediment dels llenguatges imperatius. En Prolog no existeixen instruccions de control. La seva execuci\u00F3 es basa en dos conceptes: la unificaci\u00F3 i el backtracking. Gr\u00E0cies a la unificaci\u00F3, cada objectiu determina un subconjunt de cl\u00E0usules susceptibles d'\u00E9sser executades. Cadascuna d'elles es denomina punt d'elecci\u00F3. El Prolog selecciona el primer punt d'elecci\u00F3 i segueix executant el programa fins determinar si l'objectiu \u00E9s vertader o fals. En cas de ser fals, entra en joc el backtracking. El backtracking consisteix en desfer tot all\u00F2 executat i en situar el programa en el mateix estat en el qual es trobava just abans d'arribar al punt d'elecci\u00F3. Llavors es pren el seg\u00FCent punt d'elecci\u00F3 que estava pendent i es repeteix de nou el proc\u00E9s. Tots els objectius terminen la seva execuci\u00F3 b\u00E9 sigui en \"vertader\", b\u00E9 sigui en \"fals\"."@ca ;
rdfs:comment "Prolog on tunnetuin logiikkaohjelmointikieli. Nimi Prolog on lyhenne ranskan kielen sanoista PROgrammation en LOGique, sananmukaisesti logiikkaohjelmointi. Kielen kehittiv\u00E4t vuonna 1972 Alan Colmerauer, Philippe Roussel ja Robert Kowalski vaihtoehdoksi LISPille. Logiikkaohjelmointikielen\u00E4 Prolog poikkeaa melkoisesti proseduraalisista \"tavallisista\" ohjelmointikielist\u00E4. Kielell\u00E4 tehdyt ohjelmat muodostuvat k\u00E4skyjen sijaan s\u00E4\u00E4nn\u00F6ist\u00E4 ja kyselyist\u00E4."@fi ,
"Prolog is a logic programming general purpose fifth generation language associated with artificial intelligence and computational linguistics. It has a purely logical subset, called \"pure Prolog\", as well as a number of extralogical features. Prolog has its roots in formal logic, and unlike many other programming languages, Prolog is declarative: The program logic is expressed in terms of relations, and execution is triggered by running queries over these relations."@en ,
"Prolog este un limbaj specific inteligen\u0163ei artificiale (Prolog - Programming in Logic) Originea lui apar\u0163ine lui Alain Calmaureur de la Universitatea din Marsilia, Fran\u0163a. Ini\u0163ial a fost conceput pentru analiza lexical\u0103. Azi in mod curent exista mai multe implement\u0103ri at\u00E2t open source c\u00E2t \u015Fi proprietare. Printre cele mai bune implementari open source existente azi se numara swi-prolog."@ro ,
"El Prolog (nom provinent dels mots francesos programation i logique) \u00E9s un llenguatge de programaci\u00F3 bastant popular en el medi d'investigaci\u00F3 en intel\u00B7lig\u00E8ncia artificial. Es tracta d'un llenguatge de programaci\u00F3 ideat a principis dels anys 70 a la universitat d'Ais-Marsella pels professors Alain Colmerauer i Phillipe Roussel. Inicialment es tractava d'un llenguatge totalment interpretat fins que, a mitjans dels 70, David H.D."@ca ,
"Il Prolog (PROgrammation en LOGique) \u00E8 un linguaggio di programmazione che adotta il paradigma di programmazione logica."@it ,
"\u041F\u0440\u043E\u043B\u043E\u0433\u00A0\u2014 \u044F\u0437\u044B\u043A \u0438 \u0441\u0438\u0441\u0442\u0435\u043C\u0430 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F, \u043E\u0441\u043D\u043E\u0432\u0430\u043D\u043D\u044B\u0435 \u043D\u0430 \u044F\u0437\u044B\u043A\u0435 \u043F\u0440\u0435\u0434\u0438\u043A\u0430\u0442\u043E\u0432 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u0435\u0441\u043A\u043E\u0439 \u043B\u043E\u0433\u0438\u043A\u0438 \u0434\u0438\u0437\u044A\u044E\u043D\u043A\u0442\u043E\u0432 \u0425\u043E\u0440\u043D\u0430, \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u044F\u044E\u0449\u0435\u0439 \u0441\u043E\u0431\u043E\u0439 \u043F\u043E\u0434\u043C\u043D\u043E\u0436\u0435\u0441\u0442\u0432\u043E \u043B\u043E\u0433\u0438\u043A\u0438 \u043F\u0440\u0435\u0434\u0438\u043A\u0430\u0442\u043E\u0432 \u043F\u0435\u0440\u0432\u043E\u0433\u043E \u043F\u043E\u0440\u044F\u0434\u043A\u0430."@ru ,
"Prolog ist eine Programmiersprache, die Anfang der 1970er Jahre ma\u00DFgeblich von dem franz\u00F6sischen Informatiker Alain Colmerauer entwickelt wurde und ein deklaratives Programmieren erm\u00F6glicht. Sie ist die wichtigste logische Programmiersprache. Erste Implementierungen wichen in ihrer Syntax stark voneinander ab, aber der Edinburgh-Dialekt setzte sich bald als Quasistandard durch."@de ,
"Prolog, ett programspr\u00E5k f\u00F6r logikprogrammering. Prolog skiljer sig fr\u00E5n de flesta andra programspr\u00E5k i och med att det bygger p\u00E5 logiska uttryck och inte p\u00E5 instruktioner f\u00F6r datorn. Prolog anv\u00E4nds fr\u00E4mst inom omr\u00E5dena artificiell intelligens och spr\u00E5kbehandling. Att programmera i Prolog liknar inte riktigt program skrivna i programspr\u00E5k som t. ex C, spr\u00E5ket \u00E4r uppbyggt s\u00E5 att man i sitt program definierar klausuler som returnerar sant eller falskt."@sv ,
"A Prolog egy programoz\u00E1si nyelv, melyet Alain Colmerauer fejlesztett ki 1972-ben, a Prolog n\u00E9v a francia eredet\u0171 programmation en logique kifejez\u00E9s r\u00F6vid\u00EDt\u00E9se. Az els\u0151 logikai programoz\u00E1si nyelvnek tekinthet\u0151. A Prolog egy megadott logikai formul\u00E1r\u00F3l (c\u00E9lformula) k\u00E9pes eld\u00F6nteni, hogy logikai k\u00F6vetkezm\u00E9nye-e formul\u00E1k egy adott halmaz\u00E1nak. Ut\u00F3bbi formul\u00E1k \u00E9s a c\u00E9lformula a program bemenete, a kimenet pedig a v\u00E1lasz, hogy k\u00F6vetkezik-e a c\u00E9lformula a t\u00F6bbi formul\u00E1b\u00F3l."@hu ,
"Mant\u0131k programlama dilidir. Yapay zeka uygulamalar\u0131nda kullan\u0131lan be\u015Finci nesil bilgisayar dili ailesindendir. 1970'li y\u0131llar\u0131n ba\u015Flar\u0131nda Fransa'n\u0131n Marseille Aix \u00DCniversitesi'nde Alain Colmerauer ve \u00E7al\u0131\u015Fma grubu taraf\u0131ndan icat edilmi\u015Ftir. Frans\u0131zca \"Programmation en Logique\" kelimesinden gelmektir."@tr ,
"Prolog est l\u2019un des principaux langages de programmation logique. Le nom Prolog est un acronyme de PROgrammation LOGique. Il a \u00E9t\u00E9 cr\u00E9\u00E9 par Alain Colmerauer et Philippe Roussel vers 1972. Le but \u00E9tait de faire un langage de programmation qui permettait d'utiliser l'expressivit\u00E9 de la logique au lieu de d\u00E9finir pas \u00E0 pas la succession d'instructions que doit ex\u00E9cuter un ordinateur."@fr ,
"El Prolog (o PROLOG), proveniente del franc\u00E9s PROgrammation en LOGique, es un lenguaje de programaci\u00F3n l\u00F3gico e interpretado, bastante conocido en el medio de investigaci\u00F3n en Inteligencia Artificial."@es ,
""@ja ,
"Prolog \u00E9 uma linguagem de programa\u00E7\u00E3o que se enquadra no paradigma de Programa\u00E7\u00E3o em L\u00F3gica Matem\u00E1tica. \u00C9 uma linguagem de uso geral que \u00E9 especialmente associada com a intelig\u00EAncia artificial e ling\u00FC\u00EDstica computacional. Consiste numa linguagem puramente l\u00F3gica, que pode ser chamada de Prolog puro, e numa linguagem concreta, a qual acrescenta o Prolog puro com componentes extra-l\u00F3gicos."@pt ,
"Prolog (Fr. programmation en logique, \"programmeren met logica\") is een logische programmeertaal die ontworpen werd door Robert Kowalski en Alain Colmerauer aan de universiteit van Marseille in het jaar 1973. De taal heeft een sterk logisch en declaratief karakter: feiten en relaties worden gedeclareerd in een eenvoudig soort database die bevraagd kan worden."@nl ,
"Prolog\uFF08Programming in Logic\u7684\u7F29\u5199\uFF09\u662F\u4E00\u79CD\u903B\u8F91\u7F16\u7A0B\u8BED\u8A00\u3002\u5B83\u5EFA\u7ACB\u5728\u903B\u8F91\u5B66\u7684\u7406\u8BBA\u57FA\u7840\u4E4B\u4E0A\uFF0C \u6700\u521D\u88AB\u8FD0\u7528\u4E8E\u81EA\u7136\u8BED\u8A00\u7B49\u7814\u7A76\u9886\u57DF\u3002\u73B0\u5728\u5B83\u5DF2\u5E7F\u6CDB\u7684\u5E94\u7528\u5728\u4EBA\u5DE5\u667A\u80FD\u7684\u7814\u7A76\u4E2D\uFF0C\u5B83\u53EF\u4EE5\u7528\u6765\u5EFA\u9020\u4E13\u5BB6\u7CFB\u7EDF\u3001\u81EA\u7136\u8BED\u8A00\u7406\u89E3\u3001\u667A\u80FD\u77E5\u8BC6\u5E93\u7B49\u3002"@zh ,
"Prolog je logick\u00FD programovac\u00ED jazyk. Pat\u0159\u00ED mezi tzv. deklarativn\u00ED programovac\u00ED jazyky, ve kter\u00FDch program\u00E1tor popisuje pouze c\u00EDl v\u00FDpo\u010Dtu, p\u0159i\u010Dem\u017E p\u0159esn\u00FD postup, jak\u00FDm se k v\u00FDsledku program dostane, je ponech\u00E1n na libov\u016Fli syst\u00E9mu. Prolog se sna\u017E\u00ED o pokud mo\u017Eno abstraktn\u00ED vyj\u00E1d\u0159en\u00ED fakt\u016F a logick\u00FDch vztah\u016F mezi nimi s potla\u010Den\u00EDm imperativn\u00ED slo\u017Eky."@cs ,
"Prolog (od francuskiego Programmation en Logique) to j\u0119zyk programowania logicznego - program w Prologu to opis regu\u0142y wnioskowania oraz celu do kt\u00F3rego zmierzamy, a rola komputera polega na odpowiednim zastosowaniu regu\u0142 aby znale\u017A\u0107 rozwi\u0105zanie. Prolog zosta\u0142 stworzony w 1971 roku przez Alaina Colmeraurera i Phillipe'a Roussela. U\u017Cywany w wielu programach z zakresu sztucznej inteligencji."@pl ,
"Prolog (programming in logic) er et deklarativt programmeringsspr\u00E5k satt sammen av logiske slutninger. Det best\u00E5r b\u00E5de av et rent logisk spr\u00E5k og tilleggsfunksjoner som gj\u00F8r at man kan bruke programmeringsspr\u00E5ket til det meste, som for eksempel \u00E5 lage grafiske brukergrensesnitt. Spr\u00E5ket brukes mye innen kunstig intelligens. Eksempel: Vi kan deklarere en sannhet ved \u00E5 fortelle Prolog f\u00F8lgende: katt(tom). som er ekvivalent med katt(tom) :- true."@no ,
"\u041F\u0440\u043E\u043B\u043E\u0301\u0433 \u2014 \u043C\u043E\u0432\u0430 \u043B\u043E\u0433\u0456\u0447\u043D\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F. \u041F\u0440\u043E\u043B\u043E\u0433 \u0437\u0430\u0441\u043D\u043E\u0432\u0430\u043D\u0438\u0439 \u043D\u0430 \u0442\u0435\u043E\u0440\u0456\u0457 \u043F\u0440\u0435\u0434\u0438\u043A\u0430\u0442\u0456\u0432 \u043F\u0435\u0440\u0448\u043E\u0433\u043E \u043F\u043E\u0440\u044F\u0434\u043A\u0443. \u041D\u0430\u0437\u0432\u0430 \u043C\u043E\u0432\u0438 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0440\u043E\u0437\u0448\u0438\u0444\u0440\u043E\u0432\u0443\u0454\u0442\u044C\u0441\u044F \u044F\u043A (\u041F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0432 \u043B\u043E\u0433\u0456\u0446\u0456)."@uk .
@prefix skos: .
@prefix ns10: .
dbpedia:Prolog skos:subject ns10:Computer_and_telecommunication_standards ,
ns10:Declarative_programming_languages ,
ns10:Prolog_programming_language_family .
@prefix ns11: .
dbpedia:Prolog dbpprop:wikiPageUsesTemplate ns11:infobox_programming_language ,
ns11:otheruses4 ,
ns11:lang ;
dbpprop:otheruses4Property "the sense of an introduction"@en ,
"the company"@en ,
"prologue"@en ,
"the programming language"@en ,
"other uses of \"Prologue\""@en ,
"Cyan Worlds"@en ,
"Prologue (disambiguation)"@en ;
dbpprop:year 1972 ;
dbpprop:langProperty "fr"@en ,
"programmation en logique"@en ;
dbpprop:implementations dbpedia:SICStus ,
dbpedia:P_Sharp ,
dbpedia:Poplog ,
dbpedia:BProlog ,
dbpedia:CSC_GraphTalk ,
dbpedia:Ciao_Prolog ,
dbpedia:YAP-Prolog ,
dbpedia:SWI-Prolog ,
dbpedia:TuProlog ,
dbpedia:Logic_Programming_Associates ,
dbpedia:ECLiPSe ,
dbpedia:Strawberry_Prolog ,
dbpedia:GNU_Prolog ;
dbpprop:influenced dbpedia:Visual_Prolog ,
dbpedia:KL1 ,
dbpedia:Datalog ,
dbpedia:Oz_programming_language ,
dbpedia:Erlang_programming_language ,
,
dbpedia:Mercury_programming_language ,
dbpedia:KL0 ;
dbpprop:designer dbpedia:Alain_Colmerauer ;
dbpprop:paradigm dbpedia:Logic_programming ;
dbpprop:dialects "ISO Prolog, Edinburgh Prolog"@en .
@prefix ns12: .
dbpedia:Prolog dbpprop:hasPhotoCollection ns12:Prolog .
@prefix ns13: .
dbpedia:Prolog dbpprop:wordnet_type ns13:synset-programming_language-noun-1 .
dbpedia:Datalog dbpprop:influencedBy dbpedia:Prolog .
dbpedia:GeneXus dbpprop:programmingLanguage dbpedia:Prolog .
dbpedia:QuSheet dbpprop:programmingLanguage dbpedia:Prolog .
dbpedia:Logtalk dbpprop:influencedBy dbpedia:Prolog .
@prefix ns14: .
ns14:IEC_13211-1 dbpprop:redirect dbpedia:Prolog .
dbpedia:Prolog_II dbpprop:redirect dbpedia:Prolog .
dbpprop:redirect dbpedia:Prolog .
dbpedia:PROLOG dbpprop:redirect dbpedia:Prolog .
dbpedia:PROLOG_programming_language dbpprop:redirect dbpedia:Prolog .
dbpedia:Prolog_programming_language dbpprop:redirect dbpedia:Prolog .