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 : el.dbpedia.org associated with source document(s)

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)
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 (en)
rdfs:seeAlso	Constraint satisfaction problem
sameAs	Constraint logic programming
dbp:wikiPageUsesTemplate	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:Programming_paradigms
Subject	Constraint logic programming Constraint programming Logic programming
Link from a Wikipage to an external page	https://archive.org/details/constraintproces00rina https://archive.org/details/principlesofcons0000aptk
gold:hypernym	Form
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Constraint_logic_programming?oldid=1070317449&ns=0
Wikipage page ID	4249442 (xsd:integer)
page length (characters) of wiki page	39295 (xsd:nonNegativeInteger)
Wikipage revision ID	1070317449 (xsd:integer)
Link from a Wikipage to another Wikipage	Ground expression Literal (mathematical logic) Local consistency Logic programming Logical consequence Prolog Unification (computer science) Unit propagation Air traffic control Automated planning and scheduling B-Prolog BNR Prolog Backtracking CHIP (programming language) CLP(R) Constraint logic programming Constraint programming Logic programming Oz (programming language) Ciao (programming language) Circuit (computer science) Civil engineering Concurrent computing Constraint Handling Rules Constraint programming Constraint satisfaction Constraint satisfaction problem ECLiPSe SWI-Prolog GNU Prolog Depth-first search Infinite loop Integer Interpreter (computing) Type inference Variable elimination Evaluation strategy Stack (abstract data type) Top-down and bottom-up design Mechanical engineering Real number Recursion Singleton (mathematics) dbr:Prolog_III
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)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Constraint_logic_programming
is Wikipage redirect of	Constraint Logic Programming Finite domain constraint CLP(FD) Finite constraint Constraint-logic programming Constraint Logic Programmimg Constraint store
is Link from a Wikipage to another Wikipage of	Local consistency Logic programming Alain Colmerauer B-Prolog BNR Prolog CHIP (programming language) CLP CLP(R) Glossary of artificial intelligence Dis-unification (computer science) Narrowing of algebraic value sets Computer algebra system Concolic testing Concurrent constraint logic programming Constraint Constraint Handling Rules Constraint Logic Programming Constraint programming Constraint satisfaction ECLiPSe

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software