Computational logic is a mathematical framework to redevelop logic as systematic formal theory of computability (as opposed to classical logic).
In computational logic, formulas represent computational problems and their validity means “always computable”.
- Optimization approaches to satisfiability problems, including the use of integer programming and semidefinite programming methods.
- Logical Benders decomposition approaches to hard optimization problems, including scheduling problems and mathematical programming problems with complementarity constraints.
Scientific Computation Research Center (SCOREC)