SAT Modulo Linear Arithmetic for Solving Polynomial Constraints.
Cristina BorrallerasSalvador LucasAlbert OliverasEnric Rodríguez-CarbonellAlbert RubioPublished in: J. Autom. Reason. (2012)
Keyphrases
- sat encodings
- linear constraints
- stochastic local search
- linear programming problems
- quantifier free
- nonlinear optimization problems
- low order
- sat solving
- satisfiability problem
- constrained problems
- closed form solutions
- variable ordering
- integer program
- convex quadratic programming
- interval arithmetic
- pseudo boolean
- constraint satisfaction problems
- constraint problems
- sat instances
- sat solvers
- constraint satisfaction
- quadratic program
- quantifier elimination
- distributed constraint satisfaction
- search algorithm
- np complete problems
- quadratic programming
- linear systems
- constrained optimization
- low degree
- search strategies
- set of linear equations
- pseudo boolean constraints
- first order logic