Category:Constraint programming

• Constraint programming

*

• Constraint satisfaction
• Symmetry-breaking constraints

A

• AC-3 algorithm
• Algorithm selection
• Allen's interval algebra

B

• Backjumping
• Backmarking
• Barrier function
• Basis pursuit
• Binary constraint
• BNR Prolog

C

• Cassowary (software)
• Chaff algorithm
• Complexity of constraint satisfaction
• Consensus dynamics
• Constrained optimization
• Constraint (mathematics)
• Constraint composite graph
• Constraint graph
• Constraint inference
• Constraint learning
• Constraint logic programming
• Constraint satisfaction problem

D

• Davis–Putnam algorithm
• Decomposition method (constraint satisfaction)
• Difference-map algorithm
• Distributed constraint optimization
• DPLL algorithm
• DPLL(T)

G

• Gecode
• Geometric constraint solving
• GNU Prolog

H

• Hidden transformation
• Hierarchical constraint satisfaction
• Hybrid algorithm (constraint satisfaction)

I

• ILOG
• Interchangeability algorithm
• Intertemporal budget constraint

J

• JaCoP (solver)

K

• Kaleidoscope (programming language)

L

• Local consistency
• Local search (constraint satisfaction)
• Look-ahead (backtracking)

M

• Max/min CSP/Ones classification theorems
• Min-conflicts algorithm
• Minion (solver)
• Model synthesis

N

• Narrowing of algebraic value sets
• Nurse scheduling problem

O

• Optimization Programming Language
• Ordered graph

R

• Reasoning system
• Region connection calculus
• Regular constraint

S

• Constraint satisfaction dual problem
• Satisfiability modulo theories
• Schaefer's dichotomy theorem
• SWI-Prolog

T

• Test functions for optimization
• Traveling tournament problem

W

• WalkSAT
• Weighted constraint satisfaction problem