This HTML5 document contains 131 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n12https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-srhttp://sr.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n10https://archive.org/details/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/
dbpedia-jahttp://ja.dbpedia.org/resource/

Statements

Subject Item
dbr:Prolog
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Inequation
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Let_expression
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Constraint_Handling_Rules
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbp:paradigms
dbr:Constraint_logic_programming
Subject Item
dbr:SWI-Prolog
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Narrowing_of_algebraic_value_sets
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Glossary_of_artificial_intelligence
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Concolic_testing
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Concurrent_constraint_logic_programming
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Constraint_logic_programming
rdf:type
dbo:MusicGenre owl:Thing
rdfs:label
制約論理プログラミング Constraint logic programming
rdfs:comment
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><spa 制約論理プログラミング(せいやくろんりプログラミング、英: constraint logic programming)は制約プログラミングの一種で、制約という問題表現・解決の考え方を導入することによって論理プログラミングを拡張したプログラミングパラダイムである。論理プログラミングの持っている宣言的な表現力に制約の考え方を導入し、より一般化したものとも言うことができる。
rdfs:seeAlso
dbr:Constraint_satisfaction_problem
dcterms:subject
dbc:Constraint_logic_programming dbc:Constraint_programming dbc:Logic_programming
dbo:wikiPageID
4249442
dbo:wikiPageRevisionID
1120933495
dbo:wikiPageWikiLink
dbr:Bound_consistency dbr:CLP(R) dbr:Ground_term dbr:Constraint_handling_rules dbr:CHIP_(programming_language) dbr:Depth-first dbc:Constraint_logic_programming dbr:Unit_propagation dbr:Literal_(mathematical_logic) dbr:Integer_number dbr:Evaluation_strategy dbr:Unification_(computing) dbr:Constraint_programming dbr:Constraint_satisfaction dbr:Recursion dbr:Constraint_satisfaction_problem dbr:Interpreter_(computing) dbr:Entailment dbr:Air_traffic_control dbr:Top-down_and_bottom-up_design dbr:LIFO_(computing) dbc:Constraint_programming dbr:Prolog_III dbr:Singleton_(mathematics) dbr:Mechanical_engineering dbc:Logic_programming dbr:Logic_programming dbr:ECLiPSe dbr:Digital_circuit dbr:Infinite_loop dbr:Variable_elimination dbr:Hyper-arc_consistency dbr:Constraint_Handling_Rules dbr:Ciao_(programming_language) dbr:Civil_engineering dbr:Constraint_propagation dbr:Oz_(programming_language) dbr:GNU_Prolog dbr:Real_number dbr:Type_inference dbr:BProlog dbr:Concurrent_process dbr:Local_consistency dbr:Arc_consistency dbr:SWI-Prolog dbr:BNR_Prolog dbr:Backtracking dbr:Prolog_II dbr:Automated_planning_and_scheduling
dbo:wikiPageExternalLink
n10:constraintproces00rina n10:principlesofcons0000aptk
owl:sameAs
n12:4iLuS wikidata:Q5164378 dbpedia-sr:Принудно_логичко_програмирање dbpedia-ja:制約論理プログラミング freebase:m.0bs9hr
dbp:wikiPageUsesTemplate
dbt:Sxhl dbt:Programming_paradigms dbt:Main dbt:Mvar dbt:See_also dbt:Cite_book dbt:ISBN dbt:Cite_journal dbt:Short_description dbt:Citation_needed dbt:Reflist dbt:Code
dbo:abstract
制約論理プログラミング(せいやくろんりプログラミング、英: constraint logic programming)は制約プログラミングの一種で、制約という問題表現・解決の考え方を導入することによって論理プログラミングを拡張したプログラミングパラダイムである。論理プログラミングの持っている宣言的な表現力に制約の考え方を導入し、より一般化したものとも言うことができる。 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.
gold:hypernym
dbr:Form
prov:wasDerivedFrom
wikipedia-en:Constraint_logic_programming?oldid=1120933495&ns=0
dbo:wikiPageLength
39371
foaf:isPrimaryTopicOf
wikipedia-en:Constraint_logic_programming
Subject Item
dbr:Constraint_programming
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Futures_and_promises
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Local_consistency
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Logic_programming
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Alain_Colmerauer
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:ECLiPSe
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbp:genre
dbr:Constraint_logic_programming
dbo:genre
dbr:Constraint_logic_programming
Subject Item
dbr:Dis-unification_(computer_science)
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:BNR_Prolog
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Finite_domain_constraint
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbo:wikiPageRedirects
dbr:Constraint_logic_programming
Subject Item
dbr:Symbolic_artificial_intelligence
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:B-Prolog
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:CHIP_(programming_language)
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:CLP(R)
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Constraint_Logic_Programming
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbo:wikiPageRedirects
dbr:Constraint_logic_programming
Subject Item
dbr:Semantic_spectrum
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:SAT_solver
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Satisfiability_modulo_theories
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Expert_system
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Event_calculus
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Outline_of_computer_programming
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
Subject Item
dbr:Finite_constraint
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbo:wikiPageRedirects
dbr:Constraint_logic_programming
Subject Item
dbr:Constraint-logic_programming
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbo:wikiPageRedirects
dbr:Constraint_logic_programming
Subject Item
dbr:Constraint_Logic_Programmimg
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbo:wikiPageRedirects
dbr:Constraint_logic_programming
Subject Item
dbr:Constraint_store
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbo:wikiPageRedirects
dbr:Constraint_logic_programming
Subject Item
dbr:CLP(FD)
dbo:wikiPageWikiLink
dbr:Constraint_logic_programming
dbo:wikiPageRedirects
dbr:Constraint_logic_programming
Subject Item
wikipedia-en:Constraint_logic_programming
foaf:primaryTopic
dbr:Constraint_logic_programming