Characterizing SAT Problems with the Row Convexity Property.
Hachemi BennaceurChu Min LiPublished in: CP (2002)
Keyphrases
- sat problem
- satisfiability problem
- np complete
- sat solvers
- phase transition
- constraint satisfaction problems
- davis putnam
- randomly generated
- max sat
- sat instances
- sat solving
- stochastic local search
- propositional satisfiability
- np complete problems
- boolean satisfiability
- convex hull
- solving hard
- evolutionary algorithm
- propositional logic
- search algorithm
- orders of magnitude
- sufficient conditions
- search space