Constraint satisfaction problems (CSPs) are those where the solution is a set of objects satisfying some set of constraints.
CSPs are both extremely common and extremely computationally difficult (the general case is NP-complete), so CSP solvers are a major area of research. Automated theorem provers and and answer set programming are aimed at particular cases of constraint satisfaction.
OptaPlanner uses local search to solve planning problems.