Category
page 1Constraint programming
constraint
condition of an optimization problem that a solution must satisfy
constraint programming
programming paradigm wherein relations between variables are stated in the form of constraints
DPLL algorithm
algorithm for solving the CNF-SAT problem
constraint satisfaction problem
mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations

Davis–Putnam algorithm
algorithm for check the validity of a logic formula
satisfiability modulo theories
problem of determining whether a mathematical formula is satisfiable
SWI-Prolog
SWI-Prolog is a free implementation of the programming language Prolog, commonly used for teaching and semantic web applications. It has a rich set of features, libraries for constraint logic programming, multithreading, unit testing, GUI, interfacing to Java, ODBC and others, literate programming, a web server, SGML, RDF, RDFS, developer tools (including an IDE with a GUI debugger and GUI profiler), and extensive documentation.
constrained optimization
class of optimization problems in mathematics, finance, linear programming, economics and cost modeling
GNU Prolog
general-purpose implementation of the Prolog language
barrier function
continuous function whose value increases to infinity
backjumping
In constraint programming and SAT solving, backjumping (also known as non-chronological backtracking or intelligent backtracking) is an enhancement for backtracking algorithms which reduces the search space. While backtracking always goes up one level in the search tree when all values for a variable have been tested, backjumping may go up more levels. In this article, a fixed order of evaluation of variables x_1,\ldots,x_n is used, but the same considerations apply to a dynamic order of evaluation.
AC-3 algorithm
one of a series of algorithms used for the solution of constraint satisfaction problems
test functions for optimization
functions used to evaluate optimization algorithms
constraint satisfaction
process of finding a solution to a set of constraints that impose conditions that the variables must satisfy
ILOG
ILOG S.A. was an international software company purchased and incorporated into IBM, announced in January 2009. It created enterprise software products for supply chain, business rule management, visualization, and optimization. The main product line for Business Rules Management Systems (BRMS) has been rebranded as IBM Operational Decision Management. Many of the related components retain the ILOG brand as a part of their name.
Allen's interval algebra
calculus for temporal reasoning (relating to time instances) of events