About: Constraint logic programming

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Constraint logic programming Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:MusicGenre, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FConstraint_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 A(X,Y) :- X+Y>0, B(X), C(Y

Attributes	Values
rdf:type	Thing music genre
rdfs:label	Constraint logic programming (en) 制約論理プログラミング (ja)
rdfs:comment	制約論理プログラミング（せいやくろんりプログラミング、英: constraint logic programming）は制約プログラミングの一種で、制約という問題表現・解決の考え方を導入することによって論理プログラミングを拡張したプログラミングパラダイムである。論理プログラミングの持っている宣言的な表現力に制約の考え方を導入し、より一般化したものとも言うことができる。 (ja) 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 (en)
rdfs:seeAlso	Constraint satisfaction problem
dcterms:subject	Constraint logic programming Constraint programming Logic programming
Wikipage page ID	4249442 (xsd:integer)
Wikipage revision ID	1120933495 (xsd:integer)
Link from a Wikipage to another Wikipage	BProlog Infinite loop Interpreter (computing) LIFO (computing) Constraint Handling Rules SWI-Prolog Ciao (programming language) GNU Prolog Constraint programming Constraint satisfaction Constraint satisfaction problem Top-down and bottom-up design Local consistency Logic programming Air traffic control ECLiPSe Oz (programming language) Entailment Digital circuit Variable elimination Ground term Recursion BNR Prolog Backtracking Constraint logic programming Constraint programming Logic programming Automated planning and scheduling Arc consistency CHIP (programming language) CLP(R) Civil engineering Constraint handling rules Real number Mechanical engineering Singleton (mathematics) Type inference Literal (mathematical logic) Evaluation strategy Unit propagation Hyper-arc consistency Concurrent process Constraint propagation Prolog II Integer number Unification (computing) Bound consistency Depth-first dbr:Prolog_III
Link from a Wikipage to an external page	https://archive.org/details/constraintproces00rina https://archive.org/details/principlesofcons0000aptk
sameAs	Constraint logic programming Constraint logic programming Constraint logic programming Constraint logic programming Constraint logic programming
dbp:wikiPageUsesTemplate	dbt:Programming_paradigms dbt:Citation_needed dbt:Cite_book dbt:Cite_journal dbt:Code dbt:ISBN dbt:Main dbt:Mvar dbt:Reflist dbt:See_also dbt:Short_description dbt:Sxhl
has abstract	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. (en) 制約論理プログラミング（せいやくろんりプログラミング、英: constraint logic programming）は制約プログラミングの一種で、制約という問題表現・解決の考え方を導入することによって論理プログラミングを拡張したプログラミングパラダイムである。論理プログラミングの持っている宣言的な表現力に制約の考え方を導入し、より一般化したものとも言うことができる。 (ja)
gold:hypernym	Form
prov:wasDerivedFrom	wikipedia-en:Constraint_logic_programming?oldid=1120933495&ns=0
page length (characters) of wiki page	39371 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Constraint_logic_programming
is Link from a Wikipage to another Wikipage of	Prolog Inequation Let expression Constraint Handling Rules SWI-Prolog Narrowing of algebraic value sets Glossary of artificial intelligence Concolic testing Concurrent constraint logic programming Constraint programming Futures and promises Local consistency Logic programming Alain Colmerauer

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software