Jump to content

Constraint programming: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
9thbit (talk | contribs)
32 edits
Add Numberjack
Kwaidandy (talk | contribs)
15 edits
→External links: just remove if dead
Line 137: Line 137:
*[http://www.a4cp.org/events/cp-conference-series Information on the annual CP conference]
*[http://www.a4cp.org/events/cp-conference-series Information on the annual CP conference]
*[http://kti.ms.mff.cuni.cz/~bartak/constraints/index.html On-Line Guide to Constraint Programming]
*[http://kti.ms.mff.cuni.cz/~bartak/constraints/index.html On-Line Guide to Constraint Programming]
*[http://pubsonline.informs.org/feature/pdfs/0092.2102.01.3106.29.pdf Program Does Not Equal Program: Constraint Programming and its Relationship to Mathematical Programming]{{Dead link|date=June 2011}}
*[http://www.mozart-oz.org/ Mozart] ([[Oz programming language|Oz]] based, Free software: X11 style)
*[http://www.mozart-oz.org/ Mozart] ([[Oz programming language|Oz]] based, Free software: X11 style)
*[http://www.4c.ucc.ie Cork Constraint Computation Centre (4C)]
*[http://www.4c.ucc.ie Cork Constraint Computation Centre (4C)]

Revision as of 13:37, 29 June 2013

In computer science, constraint programming is a programming paradigm wherein relations between variables are stated in the form of constraints. 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. This makes constraint programming a form of declarative programming. The constraints used in constraint programming are of various kinds: those used in constraint satisfaction problems (e.g. "A or B is true"), those solved by the simplex algorithm (e.g. "x ≤ 5"), and others. Constraints are usually embedded within a programming language or provided via separate software libraries.

Constraint programming 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 Prolog III, 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.

Constraint logic programming

Main article: Constraint logic programming

Constraint programming is an embedding of constraints in a host language. The first host languages used were logic programming languages, so the field was initially called constraint logic programming. The two paradigms share many important features, like logical variables and backtracking. Today most Prolog implementations include one or more libraries for constraint logic programming.

The difference between the two is largely in their styles and approaches to modeling the world. Some problems are more natural (and thus, simpler) to write as logic programs, while some are more natural to write as constraint programs.

The constraint programming approach is to search for a state of the world in which a large number of constraints are satisfied at the same time. A problem is typically stated as a state of the world containing a number of unknown variables. The constraint program searches for values for all the variables.

Temporal concurrent constraint programming (TCC) and non-deterministic temporal concurrent constraint programming (NTCC) are variants of constraint programming that can deal with time. Recently NTCC has proved to be a useful framework for describing and modelling biological systems [1].

Domains

The constraints used in constraint programming are typically over some specific domains. Some popular domains for constraint programming are:

Finite domains is one of the most successful domains of constraint programming. In some areas (like operations research) constraint programming is often identified with constraint programming over finite domains.

All of the above examples are commonly solved by satisfiability modulo theories (SMT) solvers.

Finite domain solvers are useful for solving constraint satisfaction problems, and are often based on arc consistency or one of its approximations.

The syntax for expressing constraints over finite domains depends on the host language. The following is a Prolog program that solves the classical alphametic puzzle SEND+MORE=MONEY in constraint logic programming: 

% This code works in both YAP and SWI-Prolog using the environment-supplied
% CLPFD constraint solver library.  It may require minor modifications to work
% in other Prolog environments or using other constraint solvers.
:- use_module(library(clpfd)).
sendmore(Digits) :-
   Digits = [S,E,N,D,M,O,R,Y],     % Create variables
   Digits ins 0..9,                % Associate domains to variables
   S #\= 0,                        % Constraint: S must be different from 0
   M #\= 0,
   all_different(Digits),          % all the elements must take different values
                1000*S + 100*E + 10*N + D     % Other constraints
              + 1000*M + 100*O + 10*R + E
   #= 10000*M + 1000*O + 100*N + 10*E + Y,
   label(Digits).                  % Start the search

The interpreter creates a variable for each letter in the puzzle. The operator ins is used to specify the domains of these variables, so that they range over the set of values {0,1,2,3, ..., 9}. The constraints S#\=0 and M#\=0 means that these two variables cannot take the value zero. When the interpreter evaluates these constraints, it reduces the domains of these two variables by removing the value 0 from them. Then, the constraint all_different(Digits) is considered; it does not reduce any domain, so it is simply stored. The last constraint specifies that the digits assigned to the letters must be such that "SEND+MORE=MONEY" holds when each letter is replaced by its corresponding digit. From this constraint, the solver infers that M=1. All stored constraints involving variable M are awakened: in this case, constraint propagation on the all_different constraint removes value 1 from the domain of all the remaining variables. Constraint propagation may solve the problem by reducing all domains to a single value, it may prove that the problem has no solution by reducing a domain to the empty set, but may also terminate without proving satisfiability or unsatisfiability. The label literals are used to actually perform search for a solution.

Logic programming based constraint logic languages

Constraint programming libraries for imperative programming languages

Constraint programming is often realized in imperative programming via a separate library. Some popular libraries for constraint programming are:

Some languages that support constraint programming

See also

References

  1. ^ CHIP V5 COSYTEC
  2. ^ Frédéric Benhamou; Narendra Jussien; Barry O'Sullivan (2007). Trends in constraint programming. John Wiley and Sons. p. 45. ISBN 978-1-905209-97-2.
  3. ^ Francesca Rossi; Peter Van Beek; Toby Walsh (2006). Handbook of constraint programming. Elsevier. p. 157. ISBN 978-0-444-52726-4.
  4. ^ Willem-Jan van Hoeve, Marcel Hunting, and Chris Kuip (2012). "The AIMMS Interface to Constraint Programming" (PDF).{{cite web}}: CS1 maint: multiple names: authors list (link)
  5. ^ "Extending an Algebraic Modeling Language to Support Constraint Programming". INFORMS Journal on Computing. 14: 322–344. 2002.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Constraint_programming&oldid=562111273"