Exploiting Isomorphic Subgraphs in SAT (Long version).
Alexander IvriiOfer StrichmanPublished in: CoRR (2021)
Keyphrases
- np hard
- branch and bound algorithm
- optimal solution
- constraint satisfaction problems
- subgraph isomorphism
- satisfiability problem
- sat problem
- boolean satisfiability
- max sat
- sat solvers
- stochastic local search algorithms
- sat solving
- phase transition
- search algorithm
- graph theoretic
- planning problems
- search space
- data structure