| http://dbpedia.org/ontology/abstract
|
制約論理プログラミング（せいやくろんりプログラミング、英: constraint logic programming）は制約プログラミングの一種で、制約という問題表現・解決の考え方を導入することによって論理プログラミングを拡張したプログラミングパラダイムである。論理プログラミングの持っている宣言的な表現力に制約の考え方を導入し、より一般化したものとも言うことができる。
, Constraint logic programming is a form of … Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is <span class="nv">A</span><span class="p">(</span><span class="nv">X</span><span class="p">,</span><span class="nv">Y</span><span class="p">)</span> <span class="p">:-</span> <span class="nv">X</span><span class="o">+</span><span class="nv">Y</span><span class="o">></span><span class="mi">0</span><span class="p">,</span> <span class="nv">B</span><span class="p">(</span><span class="nv">X</span><span class="p">),</span> <span class="nv">C</span><span class="p">(</span><span class="nv">Y</span><span class="p">)</span>. In this clause, <span class="nv">X</span><span class="o">+</span><span class="nv">Y</span><span class="o">></span><span class="mi">0</span> is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true. As in regular logic programming, programs are queried about the provability of a goal, which may contain constraints in addition to literals. A proof for a goal is composed of clauses whose bodies are satisfiable constraints and literals that can in turn be proved using other clauses. Execution is performed by an interpreter, which starts from the goal and recursively scans the clauses trying to prove the goal. Constraints encountered during this scan are placed in a set called constraint store. If this set is found out to be unsatisfiable, the interpreter backtracks, trying to use other clauses for proving the goal. In practice, satisfiability of the constraint store may be checked using an incomplete algorithm, which does not always detect inconsistency.hich does not always detect inconsistency.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://archive.org/details/principlesofcons0000aptk +
, https://archive.org/details/constraintproces00rina +
|
| http://dbpedia.org/ontology/wikiPageID
|
4249442
|
| http://dbpedia.org/ontology/wikiPageLength
|
39371
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1120933495
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Constraint_handling_rules +
, http://dbpedia.org/resource/Local_consistency +
, http://dbpedia.org/resource/Recursion +
, http://dbpedia.org/resource/Category:Constraint_logic_programming +
, http://dbpedia.org/resource/Depth-first +
, http://dbpedia.org/resource/Interpreter_%28computing%29 +
, http://dbpedia.org/resource/CHIP_%28programming_language%29 +
, http://dbpedia.org/resource/Category:Logic_programming +
, http://dbpedia.org/resource/Logic_programming +
, http://dbpedia.org/resource/Singleton_%28mathematics%29 +
, http://dbpedia.org/resource/Variable_elimination +
, http://dbpedia.org/resource/Air_traffic_control +
, http://dbpedia.org/resource/BNR_Prolog +
, http://dbpedia.org/resource/Unification_%28computing%29 +
, http://dbpedia.org/resource/Backtracking +
, http://dbpedia.org/resource/Real_number +
, http://dbpedia.org/resource/Bound_consistency +
, http://dbpedia.org/resource/Automated_planning_and_scheduling +
, http://dbpedia.org/resource/Category:Constraint_programming +
, http://dbpedia.org/resource/Prolog_II +
, http://dbpedia.org/resource/Prolog_III +
, http://dbpedia.org/resource/Constraint_propagation +
, http://dbpedia.org/resource/Integer_number +
, http://dbpedia.org/resource/Evaluation_strategy +
, http://dbpedia.org/resource/Constraint_Handling_Rules +
, http://dbpedia.org/resource/Civil_engineering +
, http://dbpedia.org/resource/Constraint_programming +
, http://dbpedia.org/resource/CLP%28R%29 +
, http://dbpedia.org/resource/Top-down_and_bottom-up_design +
, http://dbpedia.org/resource/Unit_propagation +
, http://dbpedia.org/resource/Digital_circuit +
, http://dbpedia.org/resource/Constraint_satisfaction +
, http://dbpedia.org/resource/Type_inference +
, http://dbpedia.org/resource/Literal_%28mathematical_logic%29 +
, http://dbpedia.org/resource/Entailment +
, http://dbpedia.org/resource/Hyper-arc_consistency +
, http://dbpedia.org/resource/Arc_consistency +
, http://dbpedia.org/resource/Ciao_%28programming_language%29 +
, http://dbpedia.org/resource/Concurrent_process +
, http://dbpedia.org/resource/Infinite_loop +
, http://dbpedia.org/resource/Constraint_satisfaction_problem +
, http://dbpedia.org/resource/BProlog +
, http://dbpedia.org/resource/LIFO_%28computing%29 +
, http://dbpedia.org/resource/Mechanical_engineering +
, http://dbpedia.org/resource/ECLiPSe +
, http://dbpedia.org/resource/Ground_term +
, http://dbpedia.org/resource/SWI-Prolog +
, http://dbpedia.org/resource/Oz_%28programming_language%29 +
, http://dbpedia.org/resource/GNU_Prolog +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Citation_needed +
, http://dbpedia.org/resource/Template:Cite_journal +
, http://dbpedia.org/resource/Template:Programming_paradigms +
, http://dbpedia.org/resource/Template:Cite_book +
, http://dbpedia.org/resource/Template:Sxhl +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Code +
, http://dbpedia.org/resource/Template:Main +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:ISBN +
, http://dbpedia.org/resource/Template:See_also +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Logic_programming +
, http://dbpedia.org/resource/Category:Constraint_programming +
, http://dbpedia.org/resource/Category:Constraint_logic_programming +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Form +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Constraint_logic_programming?oldid=1120933495&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Constraint_logic_programming +
|
| owl:sameAs |
http://dbpedia.org/resource/Constraint_logic_programming +
, http://ja.dbpedia.org/resource/%E5%88%B6%E7%B4%84%E8%AB%96%E7%90%86%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0 +
, http://rdf.freebase.com/ns/m.0bs9hr +
, http://www.wikidata.org/entity/Q5164378 +
, http://sr.dbpedia.org/resource/%D0%9F%D1%80%D0%B8%D0%BD%D1%83%D0%B4%D0%BD%D0%BE_%D0%BB%D0%BE%D0%B3%D0%B8%D1%87%D0%BA%D0%BE_%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%B8%D1%80%D0%B0%D1%9A%D0%B5 +
, https://global.dbpedia.org/id/4iLuS +
|
| rdf:type |
http://dbpedia.org/ontology/MusicGenre +
|
| rdfs:comment |
Constraint logic programming is a form of … Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is <span class="nv">A</span><span class="p">(</span><span class="nv">X</span><span class="p">,</span><span class="nv">Y</span><span class="p">)</span> <span class="p">:-</span> <span class="nv">X</span><span class="o">+</span><span class="nv">Y</span><span class="o">></span><span class="mi">0</span><span class="p">,</span> <span class="nv">B</span><span class="p">(</span><span class="nv">X</span><span class="p">),</span> <span class="nv">C</span><span class="p">(</span><span class="nv">Y</span><spat;span class="nv">Y</span><spa
, 制約論理プログラミング（せいやくろんりプログラミング、英: constraint logic programming）は制約プログラミングの一種で、制約という問題表現・解決の考え方を導入することによって論理プログラミングを拡張したプログラミングパラダイムである。論理プログラミングの持っている宣言的な表現力に制約の考え方を導入し、より一般化したものとも言うことができる。
|
| rdfs:label |
Constraint logic programming
, 制約論理プログラミング
|
| rdfs:seeAlso |
http://dbpedia.org/resource/Constraint_satisfaction_problem +
|
