Constraint logic programming

<p>Constraint logic programming is a form of <a href="/facts/Constraint_programming/rgkCK5bD">constraint programming</a>, in which <a href="/facts/Logic_programming/Xgh8lj3F">logic programming</a> is extended to include concepts from <a href="/facts/Constraint_satisfaction/PXI74p1T">constraint satisfaction</a>. 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). In this clause, X+Y>0 is a constraint; A(X,Y), B(X), and C(Y) are <a href="/facts/Literal_(mathematical_logic)/AjDwCJ7u">literals</a> 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.
</p><p>As in regular logic programming, programs are queried about the provability of a goal, which itself 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 <a href="/facts/Recursion/CxSKxJoW">recursively</a> scans the clauses trying to prove the goal. Constraints encountered during this scan are placed in a set called the constraint store. If this set is found out to be unsatisfiable, the interpreter <a href="/facts/Backtracking/Jm9vDUk8">backtracks</a>, 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.
</p>

Constraint logic programming open-in-new

Constraint logic programming