Generalizing DPLL and satisfiability for equalities.
Bahareh BadbanJaco van de PolOlga TveretinaHans ZantemaPublished in: Inf. Comput. (2007)
Keyphrases
- propositional logic
- davis putnam logemann loveland
- np complete
- random sat
- sat problem
- satisfiability problem
- sat instances
- sat solving
- sat solvers
- phase transition
- propositional satisfiability
- davis putnam
- clause learning
- first order logic
- max sat
- satisfiability testing
- boolean satisfiability
- randomly generated
- boolean formula
- cnf formula
- linear inequalities
- sat encodings
- belief revision
- proof procedure
- np hard
- computational complexity
- temporal logic
- constraint satisfaction problems
- stochastic local search
- search algorithm
- industrial applications
- special case
- heuristic search
- quantified boolean formulas
- satisfiability modulo theories
- search space
- simulated annealing