{ "items" : [
{ "id" : "http://dbpedia.org/resource/Logic_programming",
"properties" : {
"http://www.w3.org/1999/02/22-rdf-syntax-ns#type" : [ "http://www.w3.org/2002/07/owl#Thing",
"http://dbpedia.org/ontology/MusicGenre",
"http://dbpedia.org/ontology/ProgrammingLanguage" ] ,
"http://www.w3.org/2000/01/rdf-schema#label" : [ "\u908F\u8F2F\u7DE8\u7A0B",
"Logick\u00E9 programov\u00E1n\u00ED",
"Programmation logique",
"Programaci\u00F3 l\u00F2gica",
"\u041B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u0435",
"Logikprogrammering",
"R\u00EDomhchl\u00E1r\u00FA loighce",
"\uB17C\uB9AC\uD615 \uD504\uB85C\uADF8\uB798\uBC0D",
"\u041B\u043E\u0433\u0456\u0447\u043D\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F",
"Programa\u00E7\u00E3o l\u00F3gica",
"\u0628\u0631\u0645\u062C\u0629 \u0645\u0646\u0637\u0642\u064A\u0629",
"\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0",
"Programowanie logiczne",
"Programaci\u00F3n l\u00F3gica",
"Logisch programmeren",
"Programmazione logica",
"Logische Programmierung",
"Logic programming" ] ,
"http://www.w3.org/2000/01/rdf-schema#comment" : [ "\u908F\u8F2F\u7DE8\u7A0B\uFF08\u903B\u8F91\u7A0B\u5E8F\u8BBE\u8BA1\uFF09\u662F\u7A2E\u7DE8\u7A0B\u5178\u7BC4\uFF0C\u5B83\u8A2D\u5B9A\u7B54\u6848\u9808\u7B26\u5408\u7684\u898F\u5247\u4F86\u89E3\u6C7A\u554F\u984C\uFF0C\u800C\u975E\u8A2D\u5B9A\u6B65\u9A5F\u4F86\u89E3\u6C7A\u554F\u984C\u3002\u904E\u7A0B\u662F \u7B97\u6CD5=\u908F\u8F2F+\u63A7\u5236\u3002 \u4E0D\u540C\u7684\u65B9\u6CD5\uFF0C\u53EF\u4EE5\u770B\u82F1\u8A9E\uFF1AInductive logic programming\u3002 \u908F\u8F2F\u7DE8\u7A0B\u7684\u8981\u9EDE\u662F\u5C07\u6B63\u898F\u7684\u908F\u8F2F\u98A8\u683C\u5E36\u5165\u96FB\u8166\u7A0B\u5F0F\u8A2D\u8A08\u4E4B\u4E2D\u3002\u6578\u5B78\u5BB6\u548C\u54F2\u5B78\u5BB6\u767C\u73FE\u908F\u8F2F\u662F\u6709\u6548\u7684\u7406\u8AD6\u5206\u6790\u5DE5\u5177\u3002\u5F88\u591A\u554F\u984C\u53EF\u4EE5\u81EA\u7136\u5730\u8868\u793A\u6210\u4E00\u500B\u7406\u8AD6\u3002\u8AAA\u9700\u8981\u89E3\u7B54\u4E00\u500B\u554F\u984C\uFF0C\u901A\u5E38\u8207\u89E3\u7B54\u4E00\u500B\u65B0\u7684\u5047\u8A2D\u662F\u5426\u8DDF\u73FE\u5728\u7684\u7406\u8AD6\u7121\u885D\u7A81\u7B49\u50F9\u3002\u908F\u8F2F\u63D0\u4F9B\u4E86\u4E00\u500B\u8B49\u660E\u554F\u984C\u662F\u771F\u9084\u662F\u5047\u7684\u65B9\u6CD5\u3002\u5EFA\u7ACB\u8B49\u660E\u7684\u65B9\u6CD5\u662F\u4EBA\u6240\u7686\u77E5\u7684\uFF0C\u6545\u908F\u8F2F\u662F\u89E3\u7B54\u554F\u984C\u7684\u53EF\u9760\u65B9\u6CD5\u3002\u908F\u8F2F\u7DE8\u7A0B\u7CFB\u7D71\u5247\u81EA\u52D5\u5316\u4E86\u9019\u500B\u7A0B\u5E8F\u3002\u4EBA\u5DE5\u667A\u80FD\u5728\u908F\u8F2F\u7DE8\u7A0B\u7684\u767C\u5C55\u4E2D\u767C\u63EE\u4E86\u91CD\u8981\u7684\u5F71\u97FF\u3002 \u662F\u908F\u8F2F\u7DE8\u7A0B\u793E\u7FA4\u7684\u8457\u540D\u554F\u984C\u3002\u96FB\u8166\u9808\u81EA\u884C\u627E\u51FA\u4EE4\u7334\u5B50\u63A5\u89F8\u9999\u8549\u7684\u53EF\u884C\u65B9\u6CD5\uFF0C\u53D6\u4EE3\u7A0B\u5F0F\u8A2D\u8A08\u5E2B\u6307\u5B9A\u7334\u5B50\u63A5\u89F8\u9999\u8549\u7684\u8DEF\u5F91\u548C\u65B9\u6CD5\u3002 \u908F\u8F2F\u7DE8\u7A0B\u5EFA\u7ACB\u4E86\u63CF\u8FF0\u4E00\u500B\u554F\u984C\u88CF\u7684\u4E16\u754C\u7684\u908F\u8F2F\u6A21\u578B\u3002\u908F\u8F2F\u7DE8\u7A0B\u7684\u76EE\u6A19\u662F\u5C0D\u5B83\u7684\u6A21\u578B\u5EFA\u7ACB\u65B0\u7684\u9673\u8FF0\u3002\u4E16\u754C\u4E0A\u77E5\u8B58\u4E0D\u65B7\u81A8\u8139\u3002\u50B3\u7D71\u4F86\u8AAA\uFF0C\u6211\u5011\u6703\u5C07\u4E00\u500B\u554F\u984C\u9673\u8FF0\u6210\u55AE\u4E00\u7684\u5047\u8A2D\u3002\u908F\u8F2F\u7DE8\u7A0B\u7684\u7A0B\u5F0F\u900F\u904E\u8B49\u660E\u9019\u500B\u5047\u8A2D\u5728\u6A21\u578B\u88CF\u662F\u5426\u70BA\u771F\u4F86\u89E3\u6C7A\u554F\u984C\u3002 \u4E00\u4E9B\u7D93\u5E38\u7528\u5230\u908F\u8F2F\u7DE8\u7A0B\u5DE5\u5177\u7684\u7BC4\u7587\uFF1A \n* \u5C08\u5BB6\u7CFB\u7D71\uFF0C\u7A0B\u5F0F\u5F9E\u4E00\u500B\u5DE8\u5927\u7684\u6A21\u578B\u4E2D\u7522\u751F\u4E00\u500B\u5EFA\u8B70\u6216\u7B54\u6848\u3002 \n* \u81EA\u52D5\u5316\u5B9A\u7406\u8B49\u660E\uFF0C\u7A0B\u5F0F\u7522\u751F\u4E00\u4E9B\u65B0\u5B9A\u7406\u4F86\u64F4\u5145\u73FE\u6709\u7684\u7406\u8AD6\u3002 \u6700\u5E38\u7528\u7684\u908F\u8F2F\u7DE8\u7A0B\u8A9E\u8A00\u662FProlog\uFF0C\u53E6\u5916\u6709\u8F03\u9069\u7528\u65BC\u5927\u578B\u65B9\u6848\u7684Mercury\u3002\u8A73\u76E1\u7684\u6E05\u55AE\u53EF\u898B\u65BCCategory:\u908F\u8F2F\u7DE8\u7A0B\u8A9E\u8A00\u3002",
"\u041B\u043E\u0433\u0456\u0301\u0447\u043D\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u0301\u043D\u043D\u044F \u2014 \u043F\u0430\u0440\u0430\u0434\u0438\u0433\u043C\u0430 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F, \u0430 \u0442\u0430\u043A\u043E\u0436 \u0440\u043E\u0437\u0434\u0456\u043B \u0434\u0438\u0441\u043A\u0440\u0435\u0442\u043D\u043E\u0457 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u0438, \u0449\u043E \u0432\u0438\u0432\u0447\u0430\u0454 \u043C\u0435\u0442\u043E\u0434\u0438 \u0456 \u043C\u043E\u0436\u043B\u0438\u0432\u043E\u0441\u0442\u0456 \u0446\u0456\u0454\u0457 \u043F\u0430\u0440\u0430\u0434\u0438\u0433\u043C\u0438, \u0437\u0430\u0441\u043D\u043E\u0432\u0430\u043D\u0456 \u043D\u0430 \u0432\u0438\u0432\u0435\u0434\u0435\u043D\u043D\u0456 \u043D\u043E\u0432\u0438\u0445 \u0444\u0430\u043A\u0442\u0456\u0432 \u0437 \u0434\u0430\u043D\u0438\u0445 \u0444\u0430\u043A\u0442\u0456\u0432 \u0437\u0433\u0456\u0434\u043D\u043E \u0456\u0437 \u0437\u0430\u0434\u0430\u043D\u0438\u043C\u0438 \u043B\u043E\u0433\u0456\u0447\u043D\u0438\u043C\u0438 \u043F\u0440\u0430\u0432\u0438\u043B\u0430\u043C\u0438. \u041B\u043E\u0433\u0456\u0447\u043D\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0437\u0430\u0441\u043D\u043E\u0432\u0430\u043D\u0435 \u043D\u0430 \u0442\u0435\u043E\u0440\u0456\u0457 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u043D\u043E\u0457 \u043B\u043E\u0433\u0456\u043A\u0438. \u041D\u0430\u0439\u0432\u0456\u0434\u043E\u043C\u0456\u0448\u043E\u044E \u043C\u043E\u0432\u043E\u044E \u043B\u043E\u0433\u0456\u0447\u043D\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0454 Prolog, \u0449\u043E \u0454 \u0437\u0430 \u0441\u0432\u043E\u0454\u044E \u0441\u0443\u0442\u0442\u044E \u0443\u043D\u0456\u0432\u0435\u0440\u0441\u0430\u043B\u044C\u043D\u043E\u044E \u043C\u0430\u0448\u0438\u043D\u043E\u044E \u0432\u0438\u0432\u043E\u0434\u0443, \u0449\u043E \u043F\u0440\u0430\u0446\u044E\u0454 \u0432 \u043F\u0440\u0438\u043F\u0443\u0449\u0435\u043D\u043D\u0456 \u0437\u0430\u043C\u043A\u043D\u0435\u043D\u043E\u0441\u0442\u0456 \u0441\u0438\u0441\u0442\u0435\u043C\u0438 \u0444\u0430\u043A\u0442\u0456\u0432.",
"La programaci\u00F3 l\u00F2gica consisteix en l'aplicaci\u00F3 del corpus de coneixement sobre l\u00F2gica per al disseny de llenguatges de programaci\u00F3; no ha de confondre's amb la disciplina de la l\u00F2gica computacional. La programaci\u00F3 l\u00F2gica \u00E9s un tipus de paradigmes de programaci\u00F3 dins del paradigma de programaci\u00F3 declarativa. La resta dels subparadigmes de programaci\u00F3 dins de la programaci\u00F3 declarativa s\u00F3n: programaci\u00F3 funcional, programaci\u00F3 basada en restriccions, programes DSL (de domini espec\u00EDfic) i h\u00EDbrids. La programaci\u00F3 l\u00F2gica gira entorn del concepte de predicat, o relaci\u00F3 entre elements. La programaci\u00F3 funcional es basa en el concepte de funci\u00F3 (que no \u00E9s m\u00E9s que una evoluci\u00F3 dels predicats), de car\u00E0cter m\u00E9s matem\u00E0tic.",
"Logic programming is a programming paradigm which is largely based on formal logic. Any program written in a logic programming language is a set of sentences in logical form, expressing facts and rules about some problem domain. Major logic programming language families include Prolog, answer set programming (ASP) and Datalog. In all of these languages, rules are written in the form of clauses: H :- B1, \u2026, Bn. and are read declaratively as logical implications: H if B1 and \u2026 and Bn. H. to solve H, solve B1, and ... and solve Bn. Consider the following clause as an example: fallible(X) :- human(X).",
"\u0627\u0644\u0628\u0631\u0645\u062C\u0629 \u0627\u0644\u0645\u0646\u0637\u0642\u064A\u0629 (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Logic programming) \u0647\u064A \u0628\u0645\u0641\u0647\u0648\u0645\u0647\u0627 \u0627\u0644\u0639\u0627\u0645 \u0627\u0633\u062A\u0639\u0645\u0627\u0644 \u0627\u0644\u0645\u0646\u0637\u0642 \u0627\u0644\u0631\u064A\u0627\u0636\u064A \u0645\u0646 \u0623\u062C\u0644 \u0628\u0631\u0645\u062C\u0629 \u0627\u0644\u062D\u0627\u0633\u0648\u0628. \u0648\u064A\u0633\u062A\u0639\u0645\u0644 \u0627\u0644\u0645\u0646\u0637\u0642 \u0644\u063A\u0629 \u062A\u0635\u0631\u064A\u062D\u064A\u0629 \u0644\u0644\u062A\u0639\u0628\u064A\u0631 \u0639\u0646 \u0627\u0644\u0645\u0634\u0643\u0644\u0629. \u062E\u0644\u0627\u0641 \u0627\u0644\u0643\u062B\u064A\u0631 \u0645\u0646 \u0644\u063A\u0627\u062A \u0627\u0644\u0628\u0631\u0645\u062C\u0629 \u0627\u0644\u062A\u0642\u0644\u064A\u062F\u064A\u0629 \u0641\u0625\u0646 \u0627\u0644\u0645\u0628\u0631\u0645\u062C \u0641\u064A \u0627\u0644\u0628\u0631\u0645\u062C\u0629 \u0627\u0644\u0645\u0646\u0637\u0642\u064A\u0629 \u0644\u0627 \u064A\u0642\u0648\u0645 \u0628\u062D\u0644 \u0627\u0644\u0645\u0634\u0643\u0644\u0629 \u0628\u0634\u0643\u0644 \u0643\u0627\u0645\u0644\u060C \u0648\u0627\u0646\u0645\u0627 \u064A\u0642\u0639 \u0639\u0644\u0649 \u0639\u0627\u062A\u0642\u0647 \u0645\u0633\u0624\u0648\u0644\u064A\u0629 \u062C\u0632\u0626\u064A\u0629 \u0641\u064A \u062D\u0644 \u0627\u0644\u0645\u0634\u0643\u0644\u0629\u060C \u0648\u0647\u064A \u0628\u062A\u0645\u062B\u064A\u0644 \u0627\u0644\u0642\u0636\u0627\u064A\u0627 \u0648\u0627\u0644\u0645\u0639\u0627\u0631\u0641 \u0628\u0635\u0641\u0629 \u0645\u0646\u0637\u0642\u064A\u0629 (logical form)\u060C \u0648\u064A\u0642\u0639 \u0627\u0644\u062C\u0632\u0621 \u0627\u0644\u0622\u062E\u0631 \u0644\u062D\u0644 \u0627\u0644\u0645\u0634\u0643\u0644\u0629 \u0639\u0644\u0649 \u0645\u0627 \u064A\u062F\u0639\u0649 \u0628\u0645\u0628\u0631\u0647\u0646 \u0627\u0644\u0642\u0636\u0627\u064A\u0627 (theorem-prover) \u0623\u0648 \u0645\u0648\u0644\u062F \u0627\u0644\u0646\u0645\u0627\u0630\u062C (model-generator) \u0627\u0644\u0630\u064A \u064A\u0642\u0648\u0645 \u0628\u062D\u0644 \u0627\u0644\u0645\u0634\u0643\u0644\u0629 \u0628\u0634\u0643\u0644 \u0641\u0639\u0627\u0644.",
"Logische Programmierung (Pr\u00E4dikative Programmierung, Logikprogrammierung) ist ein Programmierparadigma, das auf der mathematischen Logik beruht. Anders als bei der imperativen Programmierung besteht ein Logik-Programm nicht aus einer Folge von Anweisungen, sondern aus einer Menge von Axiomen, welche hier als eine Ansammlung von Fakten oder Annahmen zu verstehen ist. Stellt der Benutzer eines Logik-Programms eine Anfrage, so versucht der Interpreter, die L\u00F6sungsaussage allein aus den Axiomen zu berechnen.",
"In informatica la programmazione logica \u00E8 un paradigma di programmazione nato negli anni '70 che adotta la logica del primo ordine sia per rappresentare sia per elaborare l'informazione. La programmazione logica differisce dalla programmazione tradizionale, sviluppata dalinguaggi ad alto livello quali Fortran, Cobol, Basic, Algol, Pascal, Ada, etc., in quanto richiede e nello stesso tempo consente al programmatore di descrivere la struttura logica del problema piuttosto che il modo di risolverlo . Da un punto di vista concettuale, il programmatore si pu\u00F2 cos\u00EC concentrare sugli aspetti logici del problema e sul modo migliore per rappresentarli, senza essere focalizzato sulla necessit\u00E0 di determinare in dettaglio il modo di pervenire ai risultati.",
"\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\uFF08Logic Programming\uFF09\u3068\u306F\u3001\u6570\u7406\u8AD6\u7406\u5B66\uFF08\u8A18\u53F7\u8AD6\u7406\u5B66\uFF09\u3092\u57FA\u790E\u306B\u3057\u305F\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u30D1\u30E9\u30C0\u30A4\u30E0\u3001\u307E\u305F\u306F\u6570\u7406\u8AD6\u7406\u5B66\u306E\u30B3\u30F3\u30D4\u30E5\u30FC\u30BF\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u3078\u306E\u5FDC\u7528\u3067\u3042\u308B\u3002\u5F62\u5F0F\u8AD6\u7406\u306E\u8AD6\u7406\u5F0F\u3092\u30BD\u30FC\u30B9\u30B3\u30FC\u30C9\u306E\u66F8\u5F0F\u306B\u6295\u5F71\u3059\u308B\u3053\u3068\u304C\u57FA\u672C\u306B\u306A\u308B\u3002\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u306B\u9069\u7528\u3059\u308B\u305F\u3081\u306E\u5E45\u5E83\u3044\u89E3\u91C8\u304C\u52A0\u3048\u3089\u308C\u3066\u304A\u308A\u3001\u7814\u7A76\u5BFE\u8C61\u3068\u3057\u3066\u306E\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u306F\u975E\u5E38\u306B\u591A\u69D8\u3067\u3042\u308B\u3002 \u3088\u308A\u4E00\u822C\u7684\u306B\u53D7\u3051\u5165\u308C\u3089\u308C\u3066\u3044\u308B\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u306F\u3001\u8FF0\u8A9E\u8AD6\u7406\u3092\u57FA\u790E\u306B\u3057\u3001\u554F\u984C\u9818\u57DF\u306E\u4E8B\u5B9F\u3068\u898F\u5247\u3092\u8AD6\u7406\u5F0F\u30E2\u30C7\u30EB\u66F8\u5F0F\u3067\u8868\u73FE\u3057\u3066\uFF08\u30ED\u30B8\u30C3\u30AF\uFF09\u975E\u6C7A\u5B9A\u6027\u306E\u6F14\u7E79\u306E\u5C0E\u51FA\u539F\u7406\u3092\u7528\u3044\u308B\uFF08\u30B3\u30F3\u30C8\u30ED\u30FC\u30EB\uFF09\u3068\u3044\u3046\u3082\u306E\u3067\u3042\u308B\u3002\u3053\u306E\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u30B9\u30BF\u30A4\u30EB\u3067\u6700\u3082\u666E\u53CA\u3057\u305F\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u8A00\u8A9E\u306F\u300CProlog\u300D\u3067\u3042\u308B\u3002",
"Foirm r\u00EDomhchl\u00E1raithe a bhaineann n\u00EDos m\u00F3 le meas\u00FAn\u00FA na rialacha n\u00E1 ceisteanna ar threoracha don r\u00EDomhaire. Is teangacha don ghn\u00F3 seo LISP agus Prolog.",
"La programaci\u00F3n l\u00F3gica es un tipo de paradigma de programaci\u00F3n dentro del paradigma de programaci\u00F3n declarativa. El resto de los subparadigmas de programaci\u00F3n dentro de la programaci\u00F3n declarativa son: programaci\u00F3n funcional, programaci\u00F3n con restricciones, programas DSL (de dominio espec\u00EDfico) e h\u00EDbridos. La programaci\u00F3n funcional se basa en el concepto de funci\u00F3n (que no es m\u00E1s que una evoluci\u00F3n de los predicados), de corte m\u00E1s matem\u00E1tico. La programaci\u00F3n l\u00F3gica gira en torno al concepto de predicado, o relaci\u00F3n entre elementos.",
"\uB17C\uB9AC\uD615 \uD504\uB85C\uADF8\uB798\uBC0D(\u8AD6\u7406\u578B \uD504\uB85C\uADF8\uB798\uBC0D, \uC601\uC5B4: logic programming)\uC740 \uB17C\uB9AC \uBB38\uC7A5\uC744 \uC774\uC6A9\uD558\uC5EC \uD504\uB85C\uADF8\uB7A8\uC744 \uD45C\uD604\uD558\uACE0 \uACC4\uC0B0\uC744 \uC218\uD589\uD558\uB294 \uAC1C\uB150\uC5D0 \uAE30\uBC18\uC744 \uB454\uB2E4. \uB17C\uB9AC\uD615 \uD504\uB85C\uADF8\uB798\uBC0D\uC5D0\uC11C \uBCFC \uC218 \uC788\uB294 \uC77C\uC885\uC758 \uB17C\uB9AC \uBB38\uC7A5\uB4E4\uC740 (\uBC18\uB4DC\uC2DC \uADF8\uB7F0 \uAC83\uC740 \uC544\uB2C8\uC9C0\uB9CC) \uD615\uD0DC\uB85C \uB418\uC5B4 \uC788\uB2E4: G if G1 and \u2026 and Gn \uC774\uB7EC\uD55C \uD504\uB85C\uADF8\uB7A8\uB4E4\uC740 \uC774\uB97C\uD14C\uBA74 \uC5D0\uC11C\uC640 \uAC19\uC774 \uC21C\uC218\uD558\uAC8C \uC120\uC5B8\uC801\uC73C\uB85C \uC774\uD574\uD560 \uC218 \uC788\uB2E4. \uADF8\uB7EC\uB098 \uC774\uB4E4\uC740 \uBAA9\uD45C \uCD94\uB860 \uC808\uCC28\uC640 \uAC19\uC774 \uC808\uCC28\uC801\uC73C\uB85C \uC774\uD574\uD560 \uC218\uB3C4 \uC788\uB2E4.: to show/solve G, show/solve G1 and \u2026 and Gn \uC704\uC758 \uC608\uB294 \uD504\uB864\uB85C\uADF8\uC758 \uC608\uC774\uB2E4. (answer set programming) \uBD84\uC57C\uB294 \uC808\uB300 \uBB38\uC808 \uD615\uD0DC\uAC00 \uC120\uD0DD\uC5D0 \uC758\uD574 \uD655\uC7A5\uB418\uB294 \uD558\uB098\uC758 \uC608\uC774\uB2E4.",
"Logick\u00E9 programov\u00E1n\u00ED je v \u0161ir\u0161\u00EDm v\u00FDznamu pou\u017Eit\u00ED matematick\u00E9 logiky jako prost\u0159edku pro programov\u00E1n\u00ED. Jeho po\u010D\u00E1tky m\u016F\u017Eeme vystopovat a\u017E k n\u00E1vrhu Johna McCarthyho advice taker (r\u00E1dce) [1958]. V tomto n\u00E1vrhu slou\u017E\u00ED logika pro \u010Dist\u011B deklarativn\u00ED reprezentaci jazyka a dokazova\u010D v\u011Bt (theorem-prover) nebo gener\u00E1tor model\u016F (model-generator) se pou\u017E\u00EDv\u00E1 jako \u0159e\u0161itel probl\u00E9m\u016F (problem-solver). \u0158e\u0161en\u00ED probl\u00E9mu se tak d\u011Bl\u00ED mezi program\u00E1tora (ru\u010D\u00ED za spr\u00E1vnost programu vyj\u00E1d\u0159en\u00E9 v logick\u00E9 form\u011B) a dokazova\u010D v\u011Bt nebo gener\u00E1tor model\u016F (odpov\u00EDd\u00E1 za efektivn\u00ED \u0159e\u0161en\u00ED probl\u00E9mu). B1 a \u2026 a Bn implies H",
"\u041B\u043E\u0433\u0438\u0301\u0447\u0435\u0441\u043A\u043E\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0301\u0440\u043E\u0432\u0430\u043D\u0438\u0435 \u2014 \u043F\u0430\u0440\u0430\u0434\u0438\u0433\u043C\u0430 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F, \u043E\u0441\u043D\u043E\u0432\u0430\u043D\u043D\u0430\u044F \u043D\u0430 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u0435\u0441\u043A\u043E\u0439 \u043B\u043E\u0433\u0438\u043A\u0435 \u2014 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u044B \u0432 \u043D\u0435\u0439 \u0437\u0430\u0434\u0430\u044E\u0442\u0441\u044F \u0432 \u0444\u043E\u0440\u043C\u0435 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u0438\u0445 \u0443\u0442\u0432\u0435\u0440\u0436\u0434\u0435\u043D\u0438\u0439 \u0438 \u043F\u0440\u0430\u0432\u0438\u043B \u0432\u044B\u0432\u043E\u0434\u0430. \u041D\u0430\u0438\u0431\u043E\u043B\u0435\u0435 \u0438\u0437\u0432\u0435\u0441\u0442\u043D\u044B\u0439 \u044F\u0437\u044B\u043A \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 \u2014 \u041F\u0440\u043E\u043B\u043E\u0433. \u041E\u0442 \u041F\u043B\u044D\u043D\u0435\u0440\u0430 \u0442\u0430\u043A\u0436\u0435 \u043F\u0440\u043E\u0438\u0437\u043E\u0448\u043B\u0438 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u0438\u0435 \u044F\u0437\u044B\u043A\u0438 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F , , \u0438 , \u0430 \u0442\u0430\u043A\u0436\u0435 \u044F\u0437\u044B\u043A , \u043D\u0435 \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u044E\u0449\u0438\u0445 \u043C\u0435\u0442\u043E\u0434 \u043F\u043E\u0438\u0441\u043A\u0430 \u0441 \u0432\u043E\u0437\u0432\u0440\u0430\u0442\u0430\u043C\u0438. \u042F\u0437\u044B\u043A\u0438 Mercury, Visual Prolog, Oz, , Datalog \u043E\u0441\u043D\u043E\u0432\u0430\u043D\u044B \u043D\u0430 \u041F\u0440\u043E\u043B\u043E\u0433\u0435.",
"Programowanie logiczne (nazywane tak\u017Ce programowaniem w logice lub programowaniem w j\u0119zyku logiki) \u2013 metoda programowania, b\u0119d\u0105ca odmian\u0105 programowania deklaratywnego, w kt\u00F3rej program podawany jest jako pewien zestaw zale\u017Cno\u015Bci, a obliczenia s\u0105 dowodem pewnego twierdzenia w oparciu o te zale\u017Cno\u015Bci. Na przyk\u0142ad chcemy stwierdzi\u0107, czy w danym grafie skierowanym istnieje \u015Bcie\u017Cka z pewnego punktu do pewnego innego punktu. Kraw\u0119dzie zapisane s\u0105 relacj\u0105 edge(Sk\u0105d, Dok\u0105d). Nasz program wygl\u0105da\u0142by w Prologu tak: Co czytamy nast\u0119puj\u0105co:",
"Logisch programmeren is een vorm van programmeren die valt onder het declaratieve paradigma. Een veelgebruikte logische programmeertaal is Prolog. Ook SQL is een declaratieve taal.Logische talen vinden vooral toepassing in de computationele taalkunde en de kunstmatige intelligentie. logisch programmeren is een andere vorm van logisch programmeren. \n* Katten hebben een vacht \n* Een vacht bestaat uit haren De interpreter moet in dit geval antwoord kunnen geven op de vraag \"Hebben katten haren?\". Een voorbeeld van een functionele en logische programmeertaal is Curry.",
"La programmation logique est une forme de programmation qui d\u00E9finit les applications \u00E0 l'aide : \n* d'une base de faits : ensemble de faits \u00E9l\u00E9mentaires concernant le domaine vis\u00E9 par l'application, \n* d'une : r\u00E8gles de logique associant des cons\u00E9quences plus ou moins directes \u00E0 ces faits, \n* d'un moteur d'inf\u00E9rence (ou d\u00E9monstrateur de th\u00E9or\u00E8me ) : exploite ces faits et ces r\u00E8gles en r\u00E9action \u00E0 une question ou requ\u00EAte.",
"Logikprogrammering \u00E4r ett programmeringsparadigm baserat p\u00E5 att bevis av predikatlogiska satser p\u00E5 vissa former kan automatiseras, vilket uppt\u00E4cktes av p\u00E5 1960-talet. Logikprogrammering \u00E4r deklarativ, programmeraren anger vad som ska g\u00F6ras men inte hur (som i imperativ programmering). Ett logikprogram best\u00E5r av en formulering av problemet man vill ha l\u00F6st p\u00E5 en predikatlogisk form. Sen \u00E4r det upp till en interpretator att bevisa satsen/programmet.Deklarativiteten \u00E4r en av f\u00F6rdelarna med logikprogrammering, en annan (som blir mer och mer aktuell) \u00E4r att bevis av predikatlogiska satser kan automatiskt. Det \u00E4r av stort intresse f\u00F6r att p\u00E5 ett enkelt s\u00E4tt kunna skriva effektiva program f\u00F6r datorer med flera processorer eller processork\u00E4rnor, vilket har visat sig sv\u00E5rt med imperativ programme",
"Programa\u00E7\u00E3o l\u00F3gica \u00E9 um paradigma de programa\u00E7\u00E3o que faz uso da l\u00F3gica matem\u00E1tica. John McCarthy [1958] foi o primeiro a publicar uma proposta de uso da l\u00F3gica matem\u00E1tica para programa\u00E7\u00E3o. A primeira linguagem de programa\u00E7\u00E3o l\u00F3gica foi a Planner, a qual permitia a invoca\u00E7\u00E3o orientada a padr\u00F5es de planos procedimentais de asser\u00E7\u00F5es e de objetivos. Com a necessidade de adapta\u00E7\u00E3o aos sistemas de mem\u00F3ria muito limitada, que eram dispon\u00EDveis quando ela foi desenvolvida. A linguagem Planner usava estruturas de controle de backtracking, de tal forma que apenas um \u00FAnico caminho computacional tinha que ser armazenado por vez. Em seguida, o Prolog foi desenvolvido como uma simplifica\u00E7\u00E3o do Planner que permitia a invoca\u00E7\u00E3o orientada a padr\u00F5es apenas a partir de objetivos (tamb\u00E9m baseado em backtracki" ] ,
"http://purl.org/dc/terms/subject" : [ "http://dbpedia.org/resource/Category:Programming_paradigms",
"http://dbpedia.org/resource/Category:Computer-related_introductions_in_1972",
"http://dbpedia.org/resource/Category:Logic",
"http://dbpedia.org/resource/Category:Logic_programming" ] ,
"http://dbpedia.org/ontology/wikiPageID" : [ 17927 ] ,
"http://dbpedia.org/ontology/wikiPageRevisionID" : [ 1121161240 ] ,
"http://dbpedia.org/ontology/wikiPageWikiLink" : [ "http://dbpedia.org/resource/Non-monotonic_logic",
"http://dbpedia.org/resource/Vanilla_(computing)",
"http://dbpedia.org/resource/Marseille",
"http://dbpedia.org/resource/Abductive_logic_programming",
"http://dbpedia.org/resource/Probabilistic_inductive_logic_programming",
"http://dbpedia.org/resource/\u039BProlog",
"http://dbpedia.org/resource/Oz_(programming_language)",
"http://dbpedia.org/resource/Rule-based_machine_learning",
"http://dbpedia.org/resource/Civil_engineering",
"http://dbpedia.org/resource/Machine_learning",
"http://dbpedia.org/resource/Indeterminacy_in_concurrent_computation",
"http://dbpedia.org/resource/Automated_timetabling",
"http://dbpedia.org/resource/Horn_clause",
"http://dbpedia.org/resource/Atomic_formula",
"http://dbpedia.org/resource/Backward_chaining",
"http://dbpedia.org/resource/Guard_(computing)",
"http://dbpedia.org/resource/Answer_set_programming",
"http://dbpedia.org/resource/Model_theory",
"http://dbpedia.org/resource/Formal_grammars",
"http://dbpedia.org/resource/Fixed_point_(mathematics)",
"http://dbpedia.org/resource/Category:Programming_paradigms",
"http://dbpedia.org/resource/Syracuse_University",
"http://dbpedia.org/resource/Alain_Colmerauer",
"http://dbpedia.org/resource/Fifth_generation_computer",
"http://dbpedia.org/resource/Functional_programming",
"http://dbpedia.org/resource/Programmable_logic_controller",
"http://dbpedia.org/resource/Transaction_logic",
"http://dbpedia.org/resource/Lambda_calculus",
"http://dbpedia.org/resource/Flora-2",
"http://dbpedia.org/resource/Horn_clauses",
"http://dbpedia.org/resource/Lisp_(programming_language)",
"http://dbpedia.org/resource/Programming_paradigm",
"http://dbpedia.org/resource/Symbolic_programming",
"http://dbpedia.org/resource/International_Organization_for_Standardization",
"http://dbpedia.org/resource/Boolean_satisfiability_problem",
"http://dbpedia.org/resource/Ciao_(programming_language)",
"http://dbpedia.org/resource/Mercury_programming_language",
"http://dbpedia.org/resource/Keith_Clark_(computer_scientist)",
"http://dbpedia.org/resource/Oz_programming_language",
"http://dbpedia.org/resource/Logtalk",
"http://dbpedia.org/resource/Category:Computer-related_introductions_in_1972",
"http://dbpedia.org/resource/Mechanical_engineering",
"http://dbpedia.org/resource/Program_transformation",
"http://dbpedia.org/resource/Fril",
"http://dbpedia.org/resource/Negation_as_failure",
"http://dbpedia.org/resource/And-or_tree",
"http://dbpedia.org/resource/Micro-Planner_(programming_language)",
"http://dbpedia.org/resource/SHRDLU",
"http://dbpedia.org/resource/John_Alan_Robinson",
"http://dbpedia.org/resource/HiLog",
"http://dbpedia.org/resource/Natural-language_understanding",
"http://dbpedia.org/resource/Association_for_Logic_Programming",
"http://dbpedia.org/resource/Event_calculus",
"http://dbpedia.org/resource/Cordell_Green",
"http://dbpedia.org/resource/Robert_Kowalski",
"http://dbpedia.org/resource/Metalanguage",
"http://dbpedia.org/resource/Constraint_logic_programming",
"http://dbpedia.org/resource/Statistical_relational_learning",
"http://dbpedia.org/resource/Linear_logic",
"http://dbpedia.org/resource/XSB",
"http://dbpedia.org/resource/SLD_resolution",
"http://dbpedia.org/resource/Abductive_reasoning",
"http://dbpedia.org/resource/Algebraic_Logic_Functional_programming_language",
"http://dbpedia.org/resource/Inductive_logic_programming",
"http://dbpedia.org/resource/Logic",
"http://dbpedia.org/resource/Category:Logic_programming_languages",
"http://dbpedia.org/resource/Terry_Winograd",
"http://dbpedia.org/resource/F-logic",
"http://dbpedia.org/resource/Actor_model",
"http://dbpedia.org/resource/Higher-order_logic",
"http://dbpedia.org/resource/Higher-order_programming",
"http://dbpedia.org/resource/Clausal_normal_form",
"http://dbpedia.org/resource/Reasoning_system",
"http://dbpedia.org/resource/Gerald_Jay_Sussman",
"http://dbpedia.org/resource/Clause_(logic)",
"http://dbpedia.org/resource/Proof-theoretic_semantics",
"http://dbpedia.org/resource/Digital_circuit",
"http://dbpedia.org/resource/University_of_Edinburgh",
"http://dbpedia.org/resource/Artificial_intelligence",
"http://dbpedia.org/resource/R++",
"http://dbpedia.org/resource/Concurrent_constraint_logic_programming",
"http://dbpedia.org/resource/LISP",
"http://dbpedia.org/resource/MIT",
"http://dbpedia.org/resource/Concurrent_programming",
"http://dbpedia.org/resource/Forward_chaining",
"http://dbpedia.org/resource/Control_theory",
"http://dbpedia.org/resource/Planner_(programming_language)",
"http://dbpedia.org/resource/Visual_Prolog",
"http://dbpedia.org/resource/Datalog",
"http://dbpedia.org/resource/Bertram_Raphael",
"http://dbpedia.org/resource/Satisfiability",
"http://dbpedia.org/resource/Prolog",
"http://dbpedia.org/resource/Category:Logic",
"http://dbpedia.org/resource/Alonzo_Church",
"http://dbpedia.org/resource/Closed_world_assumption",
"http://dbpedia.org/resource/Formal_methods",
"http://dbpedia.org/resource/Procedural_programming",
"http://dbpedia.org/resource/Inference_rule",
"http://dbpedia.org/resource/Fuzzy_logic",
"http://dbpedia.org/resource/Stable_model_semantics",
"http://dbpedia.org/resource/Category:Logic_programming",
"http://dbpedia.org/resource/Automated_theorem_proving",
"http://dbpedia.org/resource/Patrick_J._Hayes",
"http://dbpedia.org/resource/Dov_Gabbay",
"http://dbpedia.org/resource/John_McCarthy_(computer_scientist)",
"http://dbpedia.org/resource/Seymour_Papert",
"http://dbpedia.org/resource/Wiktionary:metalevel",
"http://dbpedia.org/resource/Situation_calculus",
"http://dbpedia.org/resource/Knowledge_representation",
"http://dbpedia.org/resource/G\u00F6del_(programming_language)",
"http://dbpedia.org/resource/Logic_in_computer_science",
"http://dbpedia.org/resource/Concurrent_logic_programming",
"http://dbpedia.org/resource/Declarative_programming",
"http://dbpedia.org/resource/Circumscription_(logic)",
"http://dbpedia.org/resource/Marvin_Minsky",
"http://dbpedia.org/resource/Air_traffic_control",
"http://dbpedia.org/resource/Stanford_University",
"http://dbpedia.org/resource/Absys",
"http://dbpedia.org/resource/Constraint_solving",
"http://dbpedia.org/resource/Programming_language",
"http://dbpedia.org/resource/Eugene_Charniak" ] ,
"http://dbpedia.org/ontology/wikiPageExternalLink" : [ "http://liinwww.ira.uka.de/bibliography/LogicProgramming/",
"https://www.ijcai.org/Proceedings/71/Papers/014%20A.pdf",
"https://repository.upenn.edu/cis_reports/711",
"http://www.mozart-oz.org/documentation/tutorial/node12.html",
"http://www.doc.ic.ac.uk/~rak/papers/the%20early%20years.pdf",
"http://www.logicprogramming.org/",
"https://web.archive.org/web/20090108012954/http:/www.mpprogramming.com/Cpp/",
"https://web.archive.org/web/20170102172145/https:/pdfs.semanticscholar.org/9993/ec68770faaab132da6945492b0e4ad07eb7b.pdf",
"http://www.cs.rit.edu/~rlaz/is2014/files/McCarthyProgramsWithCommonSense.pdf",
"http://www.cs.kuleuven.be/~dtai/projects/ALP/TPLP/",
"http://cmpe.emu.edu.tr/bayram/courses/531/forpresentation/p374-dantsin.pdf",
"http://www.pdc.dk/",
"https://www.worldcat.org/title/handbook-of-logic-in-artificial-intelligence-and-logic-programming/oclc/26300491",
"http://docs.racket-lang.org/racklog/",
"https://web.archive.org/web/20050828194751/http:/vl.fmnet.info/logic-prog/",
"https://dl.acm.org/doi/abs/10.1145/365691.365960",
"http://www.ida.liu.se/~ulfni/lpp/",
"http://redwood.cs.ttu.edu/~mgelfond/PAPERS/survey.pdf%7C" ] ,
"http://www.w3.org/2002/07/owl#sameAs" : [ "http://it.dbpedia.org/resource/Programmazione_logica",
"http://sr.dbpedia.org/resource/\u041B\u043E\u0433\u0438\u0447\u043A\u043E_\u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438\u0440\u0430\u045A\u0435",
"http://sv.dbpedia.org/resource/Logikprogrammering",
"http://tr.dbpedia.org/resource/Mant\u0131k_programlama",
"http://pt.dbpedia.org/resource/Programa\u00E7\u00E3o_l\u00F3gica",
"http://ms.dbpedia.org/resource/Pengaturcaraan_logik",
"http://gl.dbpedia.org/resource/Programaci\u00F3n_l\u00F3xica",
"http://rdf.freebase.com/ns/m.04k52",
"http://io.dbpedia.org/resource/Logikala_programigado",
"http://ca.dbpedia.org/resource/Programaci\u00F3_l\u00F2gica",
"http://fi.dbpedia.org/resource/Logiikkapohjainen_ohjelmointi",
"http://ru.dbpedia.org/resource/\u041B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0435_\u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u0435",
"http://ar.dbpedia.org/resource/\u0628\u0631\u0645\u062C\u0629_\u0645\u0646\u0637\u0642\u064A\u0629",
"http://www.wikidata.org/entity/Q275603",
"http://sq.dbpedia.org/resource/Programimi_logjik",
"http://es.dbpedia.org/resource/Programaci\u00F3n_l\u00F3gica",
"http://vi.dbpedia.org/resource/L\u1EADp_tr\u00ECnh_logic",
"http://pl.dbpedia.org/resource/Programowanie_logiczne",
"http://cs.dbpedia.org/resource/Logick\u00E9_programov\u00E1n\u00ED",
"http://ko.dbpedia.org/resource/\uB17C\uB9AC\uD615_\uD504\uB85C\uADF8\uB798\uBC0D",
"http://nl.dbpedia.org/resource/Logisch_programmeren",
"http://de.dbpedia.org/resource/Logische_Programmierung",
"http://fr.dbpedia.org/resource/Programmation_logique",
"http://bg.dbpedia.org/resource/\u041B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E_\u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438\u0440\u0430\u043D\u0435",
"http://simple.dbpedia.org/resource/Logic_programming",
"http://hr.dbpedia.org/resource/Logi\u010Dko_programiranje",
"http://he.dbpedia.org/resource/\u05EA\u05DB\u05E0\u05D5\u05EA_\u05DC\u05D5\u05D2\u05D9",
"http://zh.dbpedia.org/resource/\u908F\u8F2F\u7DE8\u7A0B",
"http://fa.dbpedia.org/resource/\u0628\u0631\u0646\u0627\u0645\u0647\u200C\u0646\u0648\u06CC\u0633\u06CC_\u0645\u0646\u0637\u0642\u06CC",
"https://global.dbpedia.org/id/2Zsct",
"http://uk.dbpedia.org/resource/\u041B\u043E\u0433\u0456\u0447\u043D\u0435_\u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F",
"http://d-nb.info/gnd/4195096-3",
"http://bs.dbpedia.org/resource/Logi\u010Dko_programiranje",
"http://bn.dbpedia.org/resource/\u09AF\u09C1\u0995\u09CD\u09A4\u09BF\u09AD\u09BF\u09A4\u09CD\u09A4\u09BF\u0995_\u09AA\u09CD\u09B0\u09CB\u0997\u09CD\u09B0\u09BE\u09AE\u09BF\u0982",
"http://et.dbpedia.org/resource/Loogiline_programmeerimine",
"http://th.dbpedia.org/resource/\u0E01\u0E32\u0E23\u0E40\u0E02\u0E35\u0E22\u0E19\u0E42\u0E1B\u0E23\u0E41\u0E01\u0E23\u0E21\u0E40\u0E0A\u0E34\u0E07\u0E15\u0E23\u0E23\u0E01\u0E30",
"http://ja.dbpedia.org/resource/\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0",
"http://ga.dbpedia.org/resource/R\u00EDomhchl\u00E1r\u00FA_loighce" ] ,
"http://dbpedia.org/property/wikiPageUsesTemplate" : [ "http://dbpedia.org/resource/Template:Types_of_programming_languages",
"http://dbpedia.org/resource/Template:POV_statement",
"http://dbpedia.org/resource/Template:Reflist",
"http://dbpedia.org/resource/Template:Commons_category",
"http://dbpedia.org/resource/Template:More_footnotes",
"http://dbpedia.org/resource/Template:Programming_paradigms",
"http://dbpedia.org/resource/Template:Main",
"http://dbpedia.org/resource/Template:Cite_book",
"http://dbpedia.org/resource/Template:Cite_journal",
"http://dbpedia.org/resource/Template:Citation_needed",
"http://dbpedia.org/resource/Template:Authority_control",
"http://dbpedia.org/resource/Template:Short_description",
"http://dbpedia.org/resource/Template:Not_a_typo",
"http://dbpedia.org/resource/Template:Computable_knowledge" ] ,
"http://dbpedia.org/ontology/abstract" : [ "In informatica la programmazione logica \u00E8 un paradigma di programmazione nato negli anni '70 che adotta la logica del primo ordine sia per rappresentare sia per elaborare l'informazione. La programmazione logica differisce dalla programmazione tradizionale, sviluppata dalinguaggi ad alto livello quali Fortran, Cobol, Basic, Algol, Pascal, Ada, etc., in quanto richiede e nello stesso tempo consente al programmatore di descrivere la struttura logica del problema piuttosto che il modo di risolverlo . Da un punto di vista concettuale, il programmatore si pu\u00F2 cos\u00EC concentrare sugli aspetti logici del problema e sul modo migliore per rappresentarli, senza essere focalizzato sulla necessit\u00E0 di determinare in dettaglio il modo di pervenire ai risultati. In particolare viene adottato il frammento della logica a clausole di Horn che rappresenta la base teorica su cui sono costruiti i linguaggi di programmazione afferenti al paradigma logico e in particolare il Prolog, o suoi sottolinguaggi, come Datalog o AnsProlog. Il meccanismo principale per elaborare teorie logiche fatte di clausole \u00E8 l'unificazione. Fra le estensioni della programmazione logica sono la programmazione logica induttiva e la programmazione logica abduttiva.",
"\u0627\u0644\u0628\u0631\u0645\u062C\u0629 \u0627\u0644\u0645\u0646\u0637\u0642\u064A\u0629 (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Logic programming) \u0647\u064A \u0628\u0645\u0641\u0647\u0648\u0645\u0647\u0627 \u0627\u0644\u0639\u0627\u0645 \u0627\u0633\u062A\u0639\u0645\u0627\u0644 \u0627\u0644\u0645\u0646\u0637\u0642 \u0627\u0644\u0631\u064A\u0627\u0636\u064A \u0645\u0646 \u0623\u062C\u0644 \u0628\u0631\u0645\u062C\u0629 \u0627\u0644\u062D\u0627\u0633\u0648\u0628. \u0648\u064A\u0633\u062A\u0639\u0645\u0644 \u0627\u0644\u0645\u0646\u0637\u0642 \u0644\u063A\u0629 \u062A\u0635\u0631\u064A\u062D\u064A\u0629 \u0644\u0644\u062A\u0639\u0628\u064A\u0631 \u0639\u0646 \u0627\u0644\u0645\u0634\u0643\u0644\u0629. \u062E\u0644\u0627\u0641 \u0627\u0644\u0643\u062B\u064A\u0631 \u0645\u0646 \u0644\u063A\u0627\u062A \u0627\u0644\u0628\u0631\u0645\u062C\u0629 \u0627\u0644\u062A\u0642\u0644\u064A\u062F\u064A\u0629 \u0641\u0625\u0646 \u0627\u0644\u0645\u0628\u0631\u0645\u062C \u0641\u064A \u0627\u0644\u0628\u0631\u0645\u062C\u0629 \u0627\u0644\u0645\u0646\u0637\u0642\u064A\u0629 \u0644\u0627 \u064A\u0642\u0648\u0645 \u0628\u062D\u0644 \u0627\u0644\u0645\u0634\u0643\u0644\u0629 \u0628\u0634\u0643\u0644 \u0643\u0627\u0645\u0644\u060C \u0648\u0627\u0646\u0645\u0627 \u064A\u0642\u0639 \u0639\u0644\u0649 \u0639\u0627\u062A\u0642\u0647 \u0645\u0633\u0624\u0648\u0644\u064A\u0629 \u062C\u0632\u0626\u064A\u0629 \u0641\u064A \u062D\u0644 \u0627\u0644\u0645\u0634\u0643\u0644\u0629\u060C \u0648\u0647\u064A \u0628\u062A\u0645\u062B\u064A\u0644 \u0627\u0644\u0642\u0636\u0627\u064A\u0627 \u0648\u0627\u0644\u0645\u0639\u0627\u0631\u0641 \u0628\u0635\u0641\u0629 \u0645\u0646\u0637\u0642\u064A\u0629 (logical form)\u060C \u0648\u064A\u0642\u0639 \u0627\u0644\u062C\u0632\u0621 \u0627\u0644\u0622\u062E\u0631 \u0644\u062D\u0644 \u0627\u0644\u0645\u0634\u0643\u0644\u0629 \u0639\u0644\u0649 \u0645\u0627 \u064A\u062F\u0639\u0649 \u0628\u0645\u0628\u0631\u0647\u0646 \u0627\u0644\u0642\u0636\u0627\u064A\u0627 (theorem-prover) \u0623\u0648 \u0645\u0648\u0644\u062F \u0627\u0644\u0646\u0645\u0627\u0630\u062C (model-generator) \u0627\u0644\u0630\u064A \u064A\u0642\u0648\u0645 \u0628\u062D\u0644 \u0627\u0644\u0645\u0634\u0643\u0644\u0629 \u0628\u0634\u0643\u0644 \u0641\u0639\u0627\u0644.",
"Programa\u00E7\u00E3o l\u00F3gica \u00E9 um paradigma de programa\u00E7\u00E3o que faz uso da l\u00F3gica matem\u00E1tica. John McCarthy [1958] foi o primeiro a publicar uma proposta de uso da l\u00F3gica matem\u00E1tica para programa\u00E7\u00E3o. A primeira linguagem de programa\u00E7\u00E3o l\u00F3gica foi a Planner, a qual permitia a invoca\u00E7\u00E3o orientada a padr\u00F5es de planos procedimentais de asser\u00E7\u00F5es e de objetivos. Com a necessidade de adapta\u00E7\u00E3o aos sistemas de mem\u00F3ria muito limitada, que eram dispon\u00EDveis quando ela foi desenvolvida. A linguagem Planner usava estruturas de controle de backtracking, de tal forma que apenas um \u00FAnico caminho computacional tinha que ser armazenado por vez. Em seguida, o Prolog foi desenvolvido como uma simplifica\u00E7\u00E3o do Planner que permitia a invoca\u00E7\u00E3o orientada a padr\u00F5es apenas a partir de objetivos (tamb\u00E9m baseado em backtracking). A partir do Planner, foram desenvolvidas as linguagens de programa\u00E7\u00E3o QA-4, Popler, Conniver, e QLISP. As linguagens de programa\u00E7\u00E3o Mercury, Visual Prolog, Oz e Frill, foram desenvolvidas a partir do Prolog. Atualmente existem linguagens de programa\u00E7\u00E3o l\u00F3gica concorrente (n\u00E3o baseadas em backtracking) derivadas do Planner (por exemplo, a Ether) e derivadas do Prolog (ver Shapiro 1989 para um apanhado geral).",
"Logische Programmierung (Pr\u00E4dikative Programmierung, Logikprogrammierung) ist ein Programmierparadigma, das auf der mathematischen Logik beruht. Anders als bei der imperativen Programmierung besteht ein Logik-Programm nicht aus einer Folge von Anweisungen, sondern aus einer Menge von Axiomen, welche hier als eine Ansammlung von Fakten oder Annahmen zu verstehen ist. Stellt der Benutzer eines Logik-Programms eine Anfrage, so versucht der Interpreter, die L\u00F6sungsaussage allein aus den Axiomen zu berechnen. Dazu werden eine Menge von so genannten Regeln und Anweisungen, die der Syntax gem\u00E4\u00DF aufgebaut sind zusammen mit der Information, welche L\u00F6sungsmethode vorgesehen ist, in den Programmcode eingef\u00FCgt. Logische Programmiersprachen geh\u00F6ren zu den deklarativen Programmiersprachen und haben ihre Urspr\u00FCnge im Forschungsgebiet K\u00FCnstliche Intelligenz. In einem imperativen Programm wird genau beschrieben, wie und in welcher Reihenfolge ein Problem zu l\u00F6sen ist. Im Gegensatz dazu wird in einem logikbasierten Programm beschrieben, was gilt. Das Wie ist durch die L\u00F6sungsmethode vorgegeben. Die L\u00F6sung wird aus den Regeln hergeleitet. Die bekannteste logische Programmiersprache ist Prolog. Zu den Begr\u00FCndern der logischen Programmierung z\u00E4hlten in den 1970er Jahren Alain Colmerauer und Robert Kowalski.",
"Logic programming is a programming paradigm which is largely based on formal logic. Any program written in a logic programming language is a set of sentences in logical form, expressing facts and rules about some problem domain. Major logic programming language families include Prolog, answer set programming (ASP) and Datalog. In all of these languages, rules are written in the form of clauses: H :- B1, \u2026, Bn. and are read declaratively as logical implications: H if B1 and \u2026 and Bn. H is called the head of the rule and B1, ..., Bn is called the body. Facts are rules that have no body, and are written in the simplified form: H. In the simplest case in which H, B1, ..., Bn are all atomic formulae, these clauses are called definite clauses or Horn clauses. However, there are many extensions of this simple case, the most important one being the case in which conditions in the body of a clause can also be negations of atomic formulas. Logic programming languages that include this extension have the knowledge representation capabilities of a non-monotonic logic. In ASP and Datalog, logic programs have only a declarative reading, and their execution is performed by means of a proof procedure or model generator whose behaviour is not meant to be controlled by the programmer. However, in the Prolog family of languages, logic programs also have a procedural interpretation as goal-reduction procedures: to solve H, solve B1, and ... and solve Bn. Consider the following clause as an example: fallible(X) :- human(X). based on an example used by Terry Winograd to illustrate the programming language Planner. As a clause in a logic program, it can be used both as a procedure to test whether X is fallible by testing whether X is human, and as a procedure to find an X which is fallible by finding an X which is human. Even facts have a procedural interpretation. For example, the clause: human(socrates). can be used both as a procedure to show that socrates is human, and as a procedure to find an X that is human by \"assigning\" socrates to X. The declarative reading of logic programs can be used by a programmer to verify their correctness. Moreover, logic-based program transformation techniques can also be used to transform logic programs into logically equivalent programs that are more efficient. In the Prolog family of logic programming languages, the programmer can also use the known problem-solving behaviour of the execution mechanism to improve the efficiency of programs.",
"Logisch programmeren is een vorm van programmeren die valt onder het declaratieve paradigma. Een veelgebruikte logische programmeertaal is Prolog. Ook SQL is een declaratieve taal.Logische talen vinden vooral toepassing in de computationele taalkunde en de kunstmatige intelligentie. logisch programmeren is een andere vorm van logisch programmeren. In een deductieve logische programmeertaal valt het redeneerproces schematisch weer te geven als feiten + regels = resultaten. De compiler/interpreter is op de hoogte van een aantal feiten, en probeert aan de hand van regels een antwoord te geven op een vraag die aan hem wordt gesteld. Voorbeelden van feiten die voor de interpreter bekend kunnen zijn: \n* Katten hebben een vacht \n* Een vacht bestaat uit haren De interpreter moet in dit geval antwoord kunnen geven op de vraag \"Hebben katten haren?\". Een voorbeeld van een functionele en logische programmeertaal is Curry.",
"Foirm r\u00EDomhchl\u00E1raithe a bhaineann n\u00EDos m\u00F3 le meas\u00FAn\u00FA na rialacha n\u00E1 ceisteanna ar threoracha don r\u00EDomhaire. Is teangacha don ghn\u00F3 seo LISP agus Prolog.",
"La programmation logique est une forme de programmation qui d\u00E9finit les applications \u00E0 l'aide : \n* d'une base de faits : ensemble de faits \u00E9l\u00E9mentaires concernant le domaine vis\u00E9 par l'application, \n* d'une : r\u00E8gles de logique associant des cons\u00E9quences plus ou moins directes \u00E0 ces faits, \n* d'un moteur d'inf\u00E9rence (ou d\u00E9monstrateur de th\u00E9or\u00E8me ) : exploite ces faits et ces r\u00E8gles en r\u00E9action \u00E0 une question ou requ\u00EAte. Cette approche se r\u00E9v\u00E8le beaucoup plus souple que la d\u00E9finition d'une succession d'instructions que l'ordinateur ex\u00E9cuterait. La programmation logique est consid\u00E9r\u00E9e comme une programmation d\u00E9clarative plut\u00F4t qu\u2019imp\u00E9rative, car elle s'attache davantage au quoi qu'au comment, le moteur assumant une large part des encha\u00EEnements. Elle est particuli\u00E8rement adapt\u00E9e aux besoins de l\u2019intelligence artificielle, dont elle est un des principaux outils.",
"Logick\u00E9 programov\u00E1n\u00ED je v \u0161ir\u0161\u00EDm v\u00FDznamu pou\u017Eit\u00ED matematick\u00E9 logiky jako prost\u0159edku pro programov\u00E1n\u00ED. Jeho po\u010D\u00E1tky m\u016F\u017Eeme vystopovat a\u017E k n\u00E1vrhu Johna McCarthyho advice taker (r\u00E1dce) [1958]. V tomto n\u00E1vrhu slou\u017E\u00ED logika pro \u010Dist\u011B deklarativn\u00ED reprezentaci jazyka a dokazova\u010D v\u011Bt (theorem-prover) nebo gener\u00E1tor model\u016F (model-generator) se pou\u017E\u00EDv\u00E1 jako \u0159e\u0161itel probl\u00E9m\u016F (problem-solver). \u0158e\u0161en\u00ED probl\u00E9mu se tak d\u011Bl\u00ED mezi program\u00E1tora (ru\u010D\u00ED za spr\u00E1vnost programu vyj\u00E1d\u0159en\u00E9 v logick\u00E9 form\u011B) a dokazova\u010D v\u011Bt nebo gener\u00E1tor model\u016F (odpov\u00EDd\u00E1 za efektivn\u00ED \u0159e\u0161en\u00ED probl\u00E9mu). \u010Cast\u011Bji se v\u0161ak logick\u00E9 programov\u00E1n\u00ED ch\u00E1pe v u\u017E\u0161\u00EDm smyslu, kdy se logika pou\u017E\u00EDv\u00E1 na deklarativn\u00ED i procedur\u00E1ln\u00ED reprezentaci jazyka. Vych\u00E1z\u00ED z faktu, \u017Ee zp\u011Btn\u011B usuzuj\u00EDc\u00ED dokazova\u010D v\u011Bt (backwards reasoning theorem-prover) pou\u017Eit\u00FD na deklarativn\u00ED v\u011Btu ve tvaru implikace: B1 a \u2026 a Bn implies H zach\u00E1z\u00ED s touto implikac\u00ED jako s c\u00EDl redukuj\u00EDc\u00ED (goal-reduction) procedurou. uka\u017E/vy\u0159e\u0161 H, uka\u017E/vy\u0159e\u0161 B1 a \u2026 a Bn. Program\u00E1tor neru\u010D\u00ED pouze za spr\u00E1vnost programu, ale i za jeho efektivitu. \u010Casto je pro dosa\u017Een\u00ED efektivity nezbytn\u00E9, aby se program\u00E1tor sezn\u00E1mil se zp\u016Fsobem, jak\u00FDm dokazova\u010D v\u011Bt \u0159e\u0161\u00ED probl\u00E9m a um\u011Bl jej vyu\u017E\u00EDvat. T\u00EDm, \u017Ee logick\u00E9 programovan\u00ED pou\u017E\u00EDv\u00E1 program k \u0159\u00EDzen\u00ED chov\u00E1n\u00ED vykonavatele programu (program executor) se podob\u00E1 tradi\u010Dn\u00EDmu imperativn\u00EDmu programov\u00E1n\u00ED. Od imperativn\u00EDch program\u016F s pouze procedur\u00E1ln\u00ED interpretac\u00ED se v\u0161ak logick\u00E9 programy li\u0161\u00ED existenc\u00ED deklarativn\u00ED logick\u00E9 interpretace, kter\u00E1 pom\u00E1h\u00E1 zajistit jejich korektnost. D\u00EDky tomu, \u017Ee jsou tyto programy deklarativn\u00ED (tedy deklaruj\u00ED, co je vstupem a v\u00FDstupem, a nezab\u00FDvaj\u00ED se t\u00EDm, jak v\u00FDpo\u010Det prob\u00EDh\u00E1), jsou na mnohem vy\u0161\u0161\u00ED konceptu\u00E1ln\u00ED \u00FArovni ne\u017E \u010Dist\u011B imperativn\u00ED programy, a jejich vykonavatel\u00E9, kte\u0159\u00ED jsou vlastn\u011B dokazova\u010Di v\u011Bt, operuj\u00ED na konceptu\u00E1ln\u011B vy\u0161\u0161\u00ED \u00FArovni ne\u017E b\u011B\u017En\u00E9 p\u0159eklada\u010De a interprety.",
"La programaci\u00F3 l\u00F2gica consisteix en l'aplicaci\u00F3 del corpus de coneixement sobre l\u00F2gica per al disseny de llenguatges de programaci\u00F3; no ha de confondre's amb la disciplina de la l\u00F2gica computacional. La programaci\u00F3 l\u00F2gica \u00E9s un tipus de paradigmes de programaci\u00F3 dins del paradigma de programaci\u00F3 declarativa. La resta dels subparadigmes de programaci\u00F3 dins de la programaci\u00F3 declarativa s\u00F3n: programaci\u00F3 funcional, programaci\u00F3 basada en restriccions, programes DSL (de domini espec\u00EDfic) i h\u00EDbrids. La programaci\u00F3 l\u00F2gica gira entorn del concepte de predicat, o relaci\u00F3 entre elements. La programaci\u00F3 funcional es basa en el concepte de funci\u00F3 (que no \u00E9s m\u00E9s que una evoluci\u00F3 dels predicats), de car\u00E0cter m\u00E9s matem\u00E0tic.",
"La programaci\u00F3n l\u00F3gica es un tipo de paradigma de programaci\u00F3n dentro del paradigma de programaci\u00F3n declarativa. El resto de los subparadigmas de programaci\u00F3n dentro de la programaci\u00F3n declarativa son: programaci\u00F3n funcional, programaci\u00F3n con restricciones, programas DSL (de dominio espec\u00EDfico) e h\u00EDbridos. La programaci\u00F3n funcional se basa en el concepto de funci\u00F3n (que no es m\u00E1s que una evoluci\u00F3n de los predicados), de corte m\u00E1s matem\u00E1tico. La programaci\u00F3n l\u00F3gica gira en torno al concepto de predicado, o relaci\u00F3n entre elementos.",
"\u041B\u043E\u0433\u0456\u0301\u0447\u043D\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u0301\u043D\u043D\u044F \u2014 \u043F\u0430\u0440\u0430\u0434\u0438\u0433\u043C\u0430 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F, \u0430 \u0442\u0430\u043A\u043E\u0436 \u0440\u043E\u0437\u0434\u0456\u043B \u0434\u0438\u0441\u043A\u0440\u0435\u0442\u043D\u043E\u0457 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u0438, \u0449\u043E \u0432\u0438\u0432\u0447\u0430\u0454 \u043C\u0435\u0442\u043E\u0434\u0438 \u0456 \u043C\u043E\u0436\u043B\u0438\u0432\u043E\u0441\u0442\u0456 \u0446\u0456\u0454\u0457 \u043F\u0430\u0440\u0430\u0434\u0438\u0433\u043C\u0438, \u0437\u0430\u0441\u043D\u043E\u0432\u0430\u043D\u0456 \u043D\u0430 \u0432\u0438\u0432\u0435\u0434\u0435\u043D\u043D\u0456 \u043D\u043E\u0432\u0438\u0445 \u0444\u0430\u043A\u0442\u0456\u0432 \u0437 \u0434\u0430\u043D\u0438\u0445 \u0444\u0430\u043A\u0442\u0456\u0432 \u0437\u0433\u0456\u0434\u043D\u043E \u0456\u0437 \u0437\u0430\u0434\u0430\u043D\u0438\u043C\u0438 \u043B\u043E\u0433\u0456\u0447\u043D\u0438\u043C\u0438 \u043F\u0440\u0430\u0432\u0438\u043B\u0430\u043C\u0438. \u041B\u043E\u0433\u0456\u0447\u043D\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0437\u0430\u0441\u043D\u043E\u0432\u0430\u043D\u0435 \u043D\u0430 \u0442\u0435\u043E\u0440\u0456\u0457 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u043D\u043E\u0457 \u043B\u043E\u0433\u0456\u043A\u0438. \u041D\u0430\u0439\u0432\u0456\u0434\u043E\u043C\u0456\u0448\u043E\u044E \u043C\u043E\u0432\u043E\u044E \u043B\u043E\u0433\u0456\u0447\u043D\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0454 Prolog, \u0449\u043E \u0454 \u0437\u0430 \u0441\u0432\u043E\u0454\u044E \u0441\u0443\u0442\u0442\u044E \u0443\u043D\u0456\u0432\u0435\u0440\u0441\u0430\u043B\u044C\u043D\u043E\u044E \u043C\u0430\u0448\u0438\u043D\u043E\u044E \u0432\u0438\u0432\u043E\u0434\u0443, \u0449\u043E \u043F\u0440\u0430\u0446\u044E\u0454 \u0432 \u043F\u0440\u0438\u043F\u0443\u0449\u0435\u043D\u043D\u0456 \u0437\u0430\u043C\u043A\u043D\u0435\u043D\u043E\u0441\u0442\u0456 \u0441\u0438\u0441\u0442\u0435\u043C\u0438 \u0444\u0430\u043A\u0442\u0456\u0432. \u041F\u0435\u0440\u0448\u043E\u044E \u043C\u043E\u0432\u043E\u044E \u043B\u043E\u0433\u0456\u0447\u043D\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0431\u0443\u043B\u0430 \u043C\u043E\u0432\u0430 Planner, \u0432 \u044F\u043A\u0456\u0439 \u0431\u0443\u043B\u0430 \u0437\u0430\u043A\u043B\u0430\u0434\u0435\u043D\u0430 \u043C\u043E\u0436\u043B\u0438\u0432\u0456\u0441\u0442\u044C \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u0438\u0447\u043D\u043E\u0433\u043E \u0432\u0438\u0432\u0435\u0434\u0435\u043D\u043D\u044F \u0440\u0435\u0437\u0443\u043B\u044C\u0442\u0430\u0442\u0443 \u0437 \u0434\u0430\u043D\u0438\u0445 \u0456 \u0437\u0430\u0434\u0430\u043D\u0438\u0445 \u043F\u0440\u0430\u0432\u0438\u043B \u043F\u0435\u0440\u0435\u0431\u043E\u0440\u0443 \u0432\u0430\u0440\u0456\u0430\u043D\u0442\u0456\u0432 (\u0441\u0443\u043A\u0443\u043F\u043D\u0456\u0441\u0442\u044C \u044F\u043A\u0438\u0445 \u043D\u0430\u0437\u0438\u0432\u0430\u043B\u0438 \u00AB\u043F\u043B\u0430\u043D\u043E\u043C\u00BB). Planner \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0432\u0430\u043B\u0438 \u0434\u043B\u044F, \u0437\u043D\u0438\u0436\u0435\u043D\u043D\u044F \u0432\u0438\u043C\u043E\u0433 \u0434\u043E \u043E\u0431\u0447\u0438\u0441\u043B\u044E\u0432\u0430\u043B\u044C\u043D\u0438\u0445 \u0440\u0435\u0441\u0443\u0440\u0441\u0456\u0432 (\u0437\u0430 \u0434\u043E\u043F\u043E\u043C\u043E\u0433\u043E\u044E \u043C\u0435\u0442\u043E\u0434\u0443 \u043F\u043E\u0448\u0443\u043A\u0443 \u0437 \u043F\u043E\u0432\u0435\u0440\u043D\u0435\u043D\u043D\u044F\u043C) \u0456 \u0434\u043B\u044F \u0432\u0438\u0432\u0435\u0434\u0435\u043D\u043D\u044F \u0444\u0430\u043A\u0442\u0456\u0432 \u0431\u0435\u0437 \u0430\u043A\u0442\u0438\u0432\u043D\u043E\u0433\u043E \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u0430\u043D\u043D\u044F \u0441\u0442\u0435\u043A\u0443. \u041F\u043E\u0442\u0456\u043C \u0431\u0443\u043B\u0430 \u0440\u043E\u0437\u0440\u043E\u0431\u043B\u0435\u043D\u0430 \u043C\u043E\u0432\u0430 Prolog, \u044F\u043A\u0430 \u043D\u0435 \u0432\u0438\u043C\u0430\u0433\u0430\u043B\u0430 \u043F\u043B\u0430\u043D\u0443 \u043F\u0435\u0440\u0435\u0431\u043E\u0440\u0443 \u0432\u0430\u0440\u0456\u0430\u043D\u0442\u0456\u0432 \u0456 \u0431\u0443\u043B\u0430, \u0432 \u0446\u044C\u043E\u043C\u0443 \u0441\u0435\u043D\u0441\u0456, \u0441\u043F\u0440\u043E\u0449\u0435\u043D\u043D\u044F\u043C \u043C\u043E\u0432\u0438 Planner. \u041D\u0430 \u043E\u0441\u043D\u043E\u0432\u0456 \u0456\u0434\u0435\u0439 Planner \u0431\u0443\u043B\u0438 \u0441\u0442\u0432\u043E\u0440\u0435\u043D\u0456 \u0442\u0430\u043A\u0456 \u043C\u043E\u0432\u0438 \u043B\u043E\u0433\u0456\u0447\u043D\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F, \u044F\u043A: , , \u0456 . \u041C\u043E\u0432\u0438 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F , , \u0456 \u0431\u0443\u043B\u0438 \u0441\u0442\u0432\u043E\u0440\u0435\u043D\u0456 \u043D\u0430 \u043E\u0441\u043D\u043E\u0432\u0456 Prolog. \u041D\u0430 \u043E\u0441\u043D\u043E\u0432\u0456 \u043C\u043E\u0432\u0438 Planner \u0431\u0443\u043B\u043E \u0440\u043E\u0437\u0440\u043E\u0431\u043B\u0435\u043D\u0435 \u0442\u0430\u043A\u043E\u0436 \u0434\u0435\u043A\u0456\u043B\u044C\u043A\u0430 \u0430\u043B\u044C\u0442\u0435\u0440\u043D\u0430\u0442\u0438\u0432\u043D\u0438\u0445 \u043C\u043E\u0432 \u043B\u043E\u0433\u0456\u0447\u043D\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F, \u043D\u0435 \u0437\u0430\u0441\u043D\u043E\u0432\u0430\u043D\u0438\u0445 \u043D\u0430 \u043C\u0435\u0442\u043E\u0434\u0456 \u043F\u043E\u0448\u0443\u043A\u0443 \u0437 \u043F\u043E\u0432\u0435\u0440\u043D\u0435\u043D\u043D\u044F\u043C, \u043D\u0430\u043F\u0440\u0438\u043A\u043B\u0430\u0434, .",
"\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\uFF08Logic Programming\uFF09\u3068\u306F\u3001\u6570\u7406\u8AD6\u7406\u5B66\uFF08\u8A18\u53F7\u8AD6\u7406\u5B66\uFF09\u3092\u57FA\u790E\u306B\u3057\u305F\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u30D1\u30E9\u30C0\u30A4\u30E0\u3001\u307E\u305F\u306F\u6570\u7406\u8AD6\u7406\u5B66\u306E\u30B3\u30F3\u30D4\u30E5\u30FC\u30BF\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u3078\u306E\u5FDC\u7528\u3067\u3042\u308B\u3002\u5F62\u5F0F\u8AD6\u7406\u306E\u8AD6\u7406\u5F0F\u3092\u30BD\u30FC\u30B9\u30B3\u30FC\u30C9\u306E\u66F8\u5F0F\u306B\u6295\u5F71\u3059\u308B\u3053\u3068\u304C\u57FA\u672C\u306B\u306A\u308B\u3002\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u306B\u9069\u7528\u3059\u308B\u305F\u3081\u306E\u5E45\u5E83\u3044\u89E3\u91C8\u304C\u52A0\u3048\u3089\u308C\u3066\u304A\u308A\u3001\u7814\u7A76\u5BFE\u8C61\u3068\u3057\u3066\u306E\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u306F\u975E\u5E38\u306B\u591A\u69D8\u3067\u3042\u308B\u3002 \u3088\u308A\u4E00\u822C\u7684\u306B\u53D7\u3051\u5165\u308C\u3089\u308C\u3066\u3044\u308B\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u306F\u3001\u8FF0\u8A9E\u8AD6\u7406\u3092\u57FA\u790E\u306B\u3057\u3001\u554F\u984C\u9818\u57DF\u306E\u4E8B\u5B9F\u3068\u898F\u5247\u3092\u8AD6\u7406\u5F0F\u30E2\u30C7\u30EB\u66F8\u5F0F\u3067\u8868\u73FE\u3057\u3066\uFF08\u30ED\u30B8\u30C3\u30AF\uFF09\u975E\u6C7A\u5B9A\u6027\u306E\u6F14\u7E79\u306E\u5C0E\u51FA\u539F\u7406\u3092\u7528\u3044\u308B\uFF08\u30B3\u30F3\u30C8\u30ED\u30FC\u30EB\uFF09\u3068\u3044\u3046\u3082\u306E\u3067\u3042\u308B\u3002\u3053\u306E\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u30B9\u30BF\u30A4\u30EB\u3067\u6700\u3082\u666E\u53CA\u3057\u305F\u8AD6\u7406\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u8A00\u8A9E\u306F\u300CProlog\u300D\u3067\u3042\u308B\u3002",
"\uB17C\uB9AC\uD615 \uD504\uB85C\uADF8\uB798\uBC0D(\u8AD6\u7406\u578B \uD504\uB85C\uADF8\uB798\uBC0D, \uC601\uC5B4: logic programming)\uC740 \uB17C\uB9AC \uBB38\uC7A5\uC744 \uC774\uC6A9\uD558\uC5EC \uD504\uB85C\uADF8\uB7A8\uC744 \uD45C\uD604\uD558\uACE0 \uACC4\uC0B0\uC744 \uC218\uD589\uD558\uB294 \uAC1C\uB150\uC5D0 \uAE30\uBC18\uC744 \uB454\uB2E4. \uB17C\uB9AC\uD615 \uD504\uB85C\uADF8\uB798\uBC0D\uC5D0\uC11C \uBCFC \uC218 \uC788\uB294 \uC77C\uC885\uC758 \uB17C\uB9AC \uBB38\uC7A5\uB4E4\uC740 (\uBC18\uB4DC\uC2DC \uADF8\uB7F0 \uAC83\uC740 \uC544\uB2C8\uC9C0\uB9CC) \uD615\uD0DC\uB85C \uB418\uC5B4 \uC788\uB2E4: G if G1 and \u2026 and Gn \uC774\uB7EC\uD55C \uD504\uB85C\uADF8\uB7A8\uB4E4\uC740 \uC774\uB97C\uD14C\uBA74 \uC5D0\uC11C\uC640 \uAC19\uC774 \uC21C\uC218\uD558\uAC8C \uC120\uC5B8\uC801\uC73C\uB85C \uC774\uD574\uD560 \uC218 \uC788\uB2E4. \uADF8\uB7EC\uB098 \uC774\uB4E4\uC740 \uBAA9\uD45C \uCD94\uB860 \uC808\uCC28\uC640 \uAC19\uC774 \uC808\uCC28\uC801\uC73C\uB85C \uC774\uD574\uD560 \uC218\uB3C4 \uC788\uB2E4.: to show/solve G, show/solve G1 and \u2026 and Gn \uC704\uC758 \uC608\uB294 \uD504\uB864\uB85C\uADF8\uC758 \uC608\uC774\uB2E4. (answer set programming) \uBD84\uC57C\uB294 \uC808\uB300 \uBB38\uC808 \uD615\uD0DC\uAC00 \uC120\uD0DD\uC5D0 \uC758\uD574 \uD655\uC7A5\uB418\uB294 \uD558\uB098\uC758 \uC608\uC774\uB2E4.",
"\u908F\u8F2F\u7DE8\u7A0B\uFF08\u903B\u8F91\u7A0B\u5E8F\u8BBE\u8BA1\uFF09\u662F\u7A2E\u7DE8\u7A0B\u5178\u7BC4\uFF0C\u5B83\u8A2D\u5B9A\u7B54\u6848\u9808\u7B26\u5408\u7684\u898F\u5247\u4F86\u89E3\u6C7A\u554F\u984C\uFF0C\u800C\u975E\u8A2D\u5B9A\u6B65\u9A5F\u4F86\u89E3\u6C7A\u554F\u984C\u3002\u904E\u7A0B\u662F \u7B97\u6CD5=\u908F\u8F2F+\u63A7\u5236\u3002 \u4E0D\u540C\u7684\u65B9\u6CD5\uFF0C\u53EF\u4EE5\u770B\u82F1\u8A9E\uFF1AInductive logic programming\u3002 \u908F\u8F2F\u7DE8\u7A0B\u7684\u8981\u9EDE\u662F\u5C07\u6B63\u898F\u7684\u908F\u8F2F\u98A8\u683C\u5E36\u5165\u96FB\u8166\u7A0B\u5F0F\u8A2D\u8A08\u4E4B\u4E2D\u3002\u6578\u5B78\u5BB6\u548C\u54F2\u5B78\u5BB6\u767C\u73FE\u908F\u8F2F\u662F\u6709\u6548\u7684\u7406\u8AD6\u5206\u6790\u5DE5\u5177\u3002\u5F88\u591A\u554F\u984C\u53EF\u4EE5\u81EA\u7136\u5730\u8868\u793A\u6210\u4E00\u500B\u7406\u8AD6\u3002\u8AAA\u9700\u8981\u89E3\u7B54\u4E00\u500B\u554F\u984C\uFF0C\u901A\u5E38\u8207\u89E3\u7B54\u4E00\u500B\u65B0\u7684\u5047\u8A2D\u662F\u5426\u8DDF\u73FE\u5728\u7684\u7406\u8AD6\u7121\u885D\u7A81\u7B49\u50F9\u3002\u908F\u8F2F\u63D0\u4F9B\u4E86\u4E00\u500B\u8B49\u660E\u554F\u984C\u662F\u771F\u9084\u662F\u5047\u7684\u65B9\u6CD5\u3002\u5EFA\u7ACB\u8B49\u660E\u7684\u65B9\u6CD5\u662F\u4EBA\u6240\u7686\u77E5\u7684\uFF0C\u6545\u908F\u8F2F\u662F\u89E3\u7B54\u554F\u984C\u7684\u53EF\u9760\u65B9\u6CD5\u3002\u908F\u8F2F\u7DE8\u7A0B\u7CFB\u7D71\u5247\u81EA\u52D5\u5316\u4E86\u9019\u500B\u7A0B\u5E8F\u3002\u4EBA\u5DE5\u667A\u80FD\u5728\u908F\u8F2F\u7DE8\u7A0B\u7684\u767C\u5C55\u4E2D\u767C\u63EE\u4E86\u91CD\u8981\u7684\u5F71\u97FF\u3002 \u662F\u908F\u8F2F\u7DE8\u7A0B\u793E\u7FA4\u7684\u8457\u540D\u554F\u984C\u3002\u96FB\u8166\u9808\u81EA\u884C\u627E\u51FA\u4EE4\u7334\u5B50\u63A5\u89F8\u9999\u8549\u7684\u53EF\u884C\u65B9\u6CD5\uFF0C\u53D6\u4EE3\u7A0B\u5F0F\u8A2D\u8A08\u5E2B\u6307\u5B9A\u7334\u5B50\u63A5\u89F8\u9999\u8549\u7684\u8DEF\u5F91\u548C\u65B9\u6CD5\u3002 \u908F\u8F2F\u7DE8\u7A0B\u5EFA\u7ACB\u4E86\u63CF\u8FF0\u4E00\u500B\u554F\u984C\u88CF\u7684\u4E16\u754C\u7684\u908F\u8F2F\u6A21\u578B\u3002\u908F\u8F2F\u7DE8\u7A0B\u7684\u76EE\u6A19\u662F\u5C0D\u5B83\u7684\u6A21\u578B\u5EFA\u7ACB\u65B0\u7684\u9673\u8FF0\u3002\u4E16\u754C\u4E0A\u77E5\u8B58\u4E0D\u65B7\u81A8\u8139\u3002\u50B3\u7D71\u4F86\u8AAA\uFF0C\u6211\u5011\u6703\u5C07\u4E00\u500B\u554F\u984C\u9673\u8FF0\u6210\u55AE\u4E00\u7684\u5047\u8A2D\u3002\u908F\u8F2F\u7DE8\u7A0B\u7684\u7A0B\u5F0F\u900F\u904E\u8B49\u660E\u9019\u500B\u5047\u8A2D\u5728\u6A21\u578B\u88CF\u662F\u5426\u70BA\u771F\u4F86\u89E3\u6C7A\u554F\u984C\u3002 \u4E00\u4E9B\u7D93\u5E38\u7528\u5230\u908F\u8F2F\u7DE8\u7A0B\u5DE5\u5177\u7684\u7BC4\u7587\uFF1A \n* \u5C08\u5BB6\u7CFB\u7D71\uFF0C\u7A0B\u5F0F\u5F9E\u4E00\u500B\u5DE8\u5927\u7684\u6A21\u578B\u4E2D\u7522\u751F\u4E00\u500B\u5EFA\u8B70\u6216\u7B54\u6848\u3002 \n* \u81EA\u52D5\u5316\u5B9A\u7406\u8B49\u660E\uFF0C\u7A0B\u5F0F\u7522\u751F\u4E00\u4E9B\u65B0\u5B9A\u7406\u4F86\u64F4\u5145\u73FE\u6709\u7684\u7406\u8AD6\u3002 \u6700\u5E38\u7528\u7684\u908F\u8F2F\u7DE8\u7A0B\u8A9E\u8A00\u662FProlog\uFF0C\u53E6\u5916\u6709\u8F03\u9069\u7528\u65BC\u5927\u578B\u65B9\u6848\u7684Mercury\u3002\u8A73\u76E1\u7684\u6E05\u55AE\u53EF\u898B\u65BCCategory:\u908F\u8F2F\u7DE8\u7A0B\u8A9E\u8A00\u3002",
"\u041B\u043E\u0433\u0438\u0301\u0447\u0435\u0441\u043A\u043E\u0435 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0301\u0440\u043E\u0432\u0430\u043D\u0438\u0435 \u2014 \u043F\u0430\u0440\u0430\u0434\u0438\u0433\u043C\u0430 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F, \u043E\u0441\u043D\u043E\u0432\u0430\u043D\u043D\u0430\u044F \u043D\u0430 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u0435\u0441\u043A\u043E\u0439 \u043B\u043E\u0433\u0438\u043A\u0435 \u2014 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u044B \u0432 \u043D\u0435\u0439 \u0437\u0430\u0434\u0430\u044E\u0442\u0441\u044F \u0432 \u0444\u043E\u0440\u043C\u0435 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u0438\u0445 \u0443\u0442\u0432\u0435\u0440\u0436\u0434\u0435\u043D\u0438\u0439 \u0438 \u043F\u0440\u0430\u0432\u0438\u043B \u0432\u044B\u0432\u043E\u0434\u0430. \u041D\u0430\u0438\u0431\u043E\u043B\u0435\u0435 \u0438\u0437\u0432\u0435\u0441\u0442\u043D\u044B\u0439 \u044F\u0437\u044B\u043A \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 \u2014 \u041F\u0440\u043E\u043B\u043E\u0433. \u041F\u0435\u0440\u0432\u044B\u043C \u044F\u0437\u044B\u043A\u043E\u043C \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 \u0431\u044B\u043B \u044F\u0437\u044B\u043A \u041F\u043B\u044D\u043D\u0435\u0440, \u0432 \u043A\u043E\u0442\u043E\u0440\u043E\u043C \u0431\u044B\u043B\u0430 \u0437\u0430\u043B\u043E\u0436\u0435\u043D\u0430 \u0432\u043E\u0437\u043C\u043E\u0436\u043D\u043E\u0441\u0442\u044C \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u0432\u044B\u0432\u043E\u0434\u0430 \u0440\u0435\u0437\u0443\u043B\u044C\u0442\u0430\u0442\u0430 \u0438\u0437 \u0434\u0430\u043D\u043D\u044B\u0445 \u0438 \u0437\u0430\u0434\u0430\u043D\u043D\u044B\u0445 \u043F\u0440\u0430\u0432\u0438\u043B \u043F\u0435\u0440\u0435\u0431\u043E\u0440\u0430 \u0432\u0430\u0440\u0438\u0430\u043D\u0442\u043E\u0432 (\u0441\u043E\u0432\u043E\u043A\u0443\u043F\u043D\u043E\u0441\u0442\u044C \u043A\u043E\u0442\u043E\u0440\u044B\u0445 \u043D\u0430\u0437\u044B\u0432\u0430\u043B\u0430\u0441\u044C \u043F\u043B\u0430\u043D\u043E\u043C). \u041F\u043B\u044D\u043D\u0435\u0440 \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u043E\u0432\u0430\u043B\u0441\u044F \u0434\u043B\u044F \u0442\u043E\u0433\u043E, \u0447\u0442\u043E\u0431\u044B \u043F\u043E\u043D\u0438\u0437\u0438\u0442\u044C \u0442\u0440\u0435\u0431\u043E\u0432\u0430\u043D\u0438\u044F \u043A \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u044C\u043D\u044B\u043C \u0440\u0435\u0441\u0443\u0440\u0441\u0430\u043C (\u0441 \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u043E\u0432\u0430\u043D\u0438\u0435\u043C \u0442\u0435\u0445\u043D\u0438\u043A\u0438 \u043F\u043E\u0438\u0441\u043A\u0430 \u0441 \u0432\u043E\u0437\u0432\u0440\u0430\u0442\u043E\u043C) \u0438 \u043E\u0431\u0435\u0441\u043F\u0435\u0447\u0438\u0442\u044C \u0432\u043E\u0437\u043C\u043E\u0436\u043D\u043E\u0441\u0442\u044C \u0432\u044B\u0432\u043E\u0434\u0430 \u0444\u0430\u043A\u0442\u043E\u0432, \u0431\u0435\u0437 \u0430\u043A\u0442\u0438\u0432\u043D\u043E\u0433\u043E \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u043E\u0432\u0430\u043D\u0438\u044F \u0441\u0442\u0435\u043A\u0430. \u0417\u0430\u0442\u0435\u043C \u0431\u044B\u043B \u0440\u0430\u0437\u0440\u0430\u0431\u043E\u0442\u0430\u043D \u041F\u0440\u043E\u043B\u043E\u0433, \u043A\u043E\u0442\u043E\u0440\u044B\u0439 \u043D\u0435 \u0442\u0440\u0435\u0431\u043E\u0432\u0430\u043B \u043F\u043B\u0430\u043D\u0430 \u043F\u0435\u0440\u0435\u0431\u043E\u0440\u0430 \u0432\u0430\u0440\u0438\u0430\u043D\u0442\u043E\u0432 \u0438 \u0431\u044B\u043B, \u0432 \u044D\u0442\u043E\u043C \u0441\u043C\u044B\u0441\u043B\u0435, \u0443\u043F\u0440\u043E\u0449\u0435\u043D\u0438\u0435\u043C \u041F\u043B\u044D\u043D\u0435\u0440\u0430. \u041E\u0442 \u041F\u043B\u044D\u043D\u0435\u0440\u0430 \u0442\u0430\u043A\u0436\u0435 \u043F\u0440\u043E\u0438\u0437\u043E\u0448\u043B\u0438 \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u0438\u0435 \u044F\u0437\u044B\u043A\u0438 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u044F , , \u0438 , \u0430 \u0442\u0430\u043A\u0436\u0435 \u044F\u0437\u044B\u043A , \u043D\u0435 \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u044E\u0449\u0438\u0445 \u043C\u0435\u0442\u043E\u0434 \u043F\u043E\u0438\u0441\u043A\u0430 \u0441 \u0432\u043E\u0437\u0432\u0440\u0430\u0442\u0430\u043C\u0438. \u042F\u0437\u044B\u043A\u0438 Mercury, Visual Prolog, Oz, , Datalog \u043E\u0441\u043D\u043E\u0432\u0430\u043D\u044B \u043D\u0430 \u041F\u0440\u043E\u043B\u043E\u0433\u0435.",
"Programowanie logiczne (nazywane tak\u017Ce programowaniem w logice lub programowaniem w j\u0119zyku logiki) \u2013 metoda programowania, b\u0119d\u0105ca odmian\u0105 programowania deklaratywnego, w kt\u00F3rej program podawany jest jako pewien zestaw zale\u017Cno\u015Bci, a obliczenia s\u0105 dowodem pewnego twierdzenia w oparciu o te zale\u017Cno\u015Bci. Na przyk\u0142ad chcemy stwierdzi\u0107, czy w danym grafie skierowanym istnieje \u015Bcie\u017Cka z pewnego punktu do pewnego innego punktu. Kraw\u0119dzie zapisane s\u0105 relacj\u0105 edge(Sk\u0105d, Dok\u0105d). Nasz program wygl\u0105da\u0142by w Prologu tak: path(A,B) :- walk(A,B,[]).walk(A,B,V) :- edge(A,X), not(member(X,V)), (B = X; walk(X,B,[A|V])). Co czytamy nast\u0119puj\u0105co: \n* istnieje \u015Bcie\u017Cka z X do Y, je\u015Bli mo\u017Cna przej\u015B\u0107 z A do B \n* istnieje \u015Bcie\u017Cka z X do Y, je\u015Bli dla jakiego\u015B Z istnieje kraw\u0119d\u017A z X do Z, oraz \u015Bcie\u017Cka z Z do Y Programowanie logiczne umo\u017Cliwia \u0142atwy zapis wielu algorytm\u00F3w, a programy logiczne w przeciwie\u0144stwie do imperatywnych \u0142atwo te\u017C wykonywa\u0107 r\u00F3wnolegle.",
"Logikprogrammering \u00E4r ett programmeringsparadigm baserat p\u00E5 att bevis av predikatlogiska satser p\u00E5 vissa former kan automatiseras, vilket uppt\u00E4cktes av p\u00E5 1960-talet. Logikprogrammering \u00E4r deklarativ, programmeraren anger vad som ska g\u00F6ras men inte hur (som i imperativ programmering). Ett logikprogram best\u00E5r av en formulering av problemet man vill ha l\u00F6st p\u00E5 en predikatlogisk form. Sen \u00E4r det upp till en interpretator att bevisa satsen/programmet.Deklarativiteten \u00E4r en av f\u00F6rdelarna med logikprogrammering, en annan (som blir mer och mer aktuell) \u00E4r att bevis av predikatlogiska satser kan automatiskt. Det \u00E4r av stort intresse f\u00F6r att p\u00E5 ett enkelt s\u00E4tt kunna skriva effektiva program f\u00F6r datorer med flera processorer eller processork\u00E4rnor, vilket har visat sig sv\u00E5rt med imperativ programmering.Bland nackdelarna m\u00E4rks att logikprogram \u00E4r ineffektiva p\u00E5 enprocessorsmaskiner, samt att logikprogrammering \u00E4r sv\u00E5rt att l\u00E4ra sig f\u00F6r den som saknar kunskap om predikatlogik.Det f\u00F6rsta praktiskt anv\u00E4ndbara logikprogrammeringsspr\u00E5ket, och fortfarande det mest spridda, \u00E4r Prolog.Logikprogrammering var som mest uppm\u00E4rksammad p\u00E5 1980-talet, ofta i samband med artificiell intelligens.Bland svenska forskare som gjort insatser inom logikprogrammering kan n\u00E4mnas Sten-\u00C5ke T\u00E4rnlund, , Sverker Janson, Seif Haridi och ." ] ,
"http://purl.org/linguistics/gold/hypernym" : [ "http://dbpedia.org/resource/Paradigm" ] ,
"http://www.w3.org/ns/prov#wasDerivedFrom" : [ "http://en.wikipedia.org/wiki/Logic_programming?oldid=1121161240&ns=0" ] ,
"http://dbpedia.org/ontology/wikiPageLength" : [ 39514 ] ,
"http://xmlns.com/foaf/0.1/isPrimaryTopicOf" : [ "http://en.wikipedia.org/wiki/Logic_programming"] } } ] }