A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions.
Gilles AudemardPiergiorgio BertoliAlessandro CimattiArtur KornilowiczRoberto SebastianiPublished in: CADE (2002)
Keyphrases
- boolean formula
- linear constraints
- sat solvers
- davis putnam logemann loveland
- conjunctive normal form
- np complete
- convex quadratic programming
- sat instances
- mathematical formulas
- boolean satisfiability
- quadratic programming
- sat problem
- stochastic local search
- real valued
- practical problems
- sat solving
- boolean functions
- weighted max sat
- sat encodings
- mathematical expressions
- boolean expressions
- np complete problems
- algebraic equations
- orders of magnitude
- random sat
- variable ordering
- propositional formulas
- quadratic program
- graph coloring
- satisfiability problem
- search algorithm