About: Constraint programming

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

About: Constraint programming Goto Sponge NotDistinct Permalink

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

Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. In constraint programming, users declaratively state the constraints on the feasible solutions for a set of decision variables. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found. In addition to constraints, users also need to specify a method to solve these constraints. This typically draws upon standard methods like chronological backtracking and constraint propagation, but may use customized code like a problem specific branching heuristic.

Attributes	Values
rdf:type	Thing programming language
rdfs:label	Constraint programming (en)
rdfs:comment	Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. In constraint programming, users declaratively state the constraints on the feasible solutions for a set of decision variables. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found. In addition to constraints, users also need to specify a method to solve these constraints. This typically draws upon standard methods like chronological backtracking and constraint propagation, but may use customized code like a problem specific branching heuristic. (en)
sameAs	Constraint programming Constraint programming
dbp:wikiPageUsesTemplate	dbt:Authority_control dbt:Commonscat dbt:Main dbt:Original_research dbt:Reflist dbt:Webarchive dbt:Math_theorem dbt:Programming_paradigms dbt:Programming_language
Subject	Constraint programming Declarative programming Programming paradigms
Link from a Wikipage to an external page	http://kti.ms.mff.cuni.cz/~bartak/constraints/index.html http://www.a4cp.org/events/cp-conference-series http://www.a4cp.org/ https://sofdem.github.io/gccat/index.html https://archive.today/20121205051244/http:/www.mozart-oz.org/ https://archive.today/20130107222548/http:/4c.ucc.ie/web/index.jsp
gold:hypernym	Paradigm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Constraint_programming?oldid=1057052808&ns=0
Wikipage page ID	189899 (xsd:integer)
page length (characters) of wiki page	17113 (xsd:nonNegativeInteger)
Wikipage revision ID	1057052808 (xsd:integer)
Link from a Wikipage to another Wikipage	Local consistency Logic programming Nonlinear system Nurse scheduling problem Prolog Verbal arithmetic X Window System Optimal substructure Algorithm Artificial intelligence Backtracking Boolean data type Boolean satisfiability problem CHIP (programming language) CLP(R) Constraint programming Declarative programming Programming paradigms Oz (programming language) Linear algebra Linearity Spreadsheet Combinatorial optimization Combinatorics Computational problem Computer science Concurrent constraint logic programming Consistency Constraint (mathematics) Constraint logic programming Constraint satisfaction problem Heuristic (computer science) Operations research Rewriting Finite set Functional programming Imperative programming Integer Interval (mathematics) Traveling tournament problem Kaleidoscope (programming language) Language primitive Mathematical optimization Rational number Recursion dbr:Wiktionary:finite dbr:Prolog_III
has abstract	Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. In constraint programming, users declaratively state the constraints on the feasible solutions for a set of decision variables. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found. In addition to constraints, users also need to specify a method to solve these constraints. This typically draws upon standard methods like chronological backtracking and constraint propagation, but may use customized code like a problem specific branching heuristic. Constraint programming takes its root from and can be expressed in the form of constraint logic programming, which embeds constraints into a logic program. This variant of logic programming is due to Jaffar and Lassez, who extended in 1987 a specific class of constraints that were introduced in Prolog II. The first implementations of constraint logic programming were , CLP(R), and CHIP. Instead of logic programming, constraints can be mixed with functional programming, term rewriting, and imperative languages.Programming languages with built-in support for constraints include Oz (functional programming) and Kaleidoscope (imperative programming). Mostly, constraints are implemented in imperative languages via constraint solving toolkits, which are separate libraries for an existing imperative language. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Constraint_programming
is Wikipage redirect of	List of constraint programming libraries Babelsberg (programming language) List of logic programming based constraint logic languages Constraint modeling language Constraint programming language Constraint solver Constraint solving toolkit
is Link from a Wikipage to another Wikipage of	Local consistency Nl (format) Nurse scheduling problem OR-Tools List of constraint programming libraries AIMMS AMPL Alice (programming language) Alma-0 Babelsberg (programming language) Bertrand (programming language) Bigtop (Microsoft product) List of logic programming based constraint logic languages Brute-force search CP

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