Incorporating SAT solvers into hierarchical clustering algorithms: an efficient and flexible approach.
Sean GilpinIan N. DavidsonPublished in: KDD (2011)
Keyphrases
- sat solvers
- hierarchical clustering algorithms
- highly efficient
- orders of magnitude
- constraint satisfaction
- sat solving
- propositional satisfiability
- max sat
- sat problem
- search strategies
- search space
- boolean satisfiability
- search tree
- hierarchical clustering
- sat instances
- single link
- sat encodings
- clause learning
- industrial applications
- hierarchical clustering algorithm
- boolean formula
- upper bound
- optimal solution
- weighted max sat