Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT.
Andrew FishAlexei LisitsaDavid StanovskýSarah SwartwoodPublished in: ICMS (2016)
Keyphrases
- sat solvers
- satisfiability problem
- satisfiability testing
- search algorithm
- sat problem
- stochastic local search algorithms
- boolean satisfiability
- sat solving
- data sets
- phase transition
- search space
- computationally expensive
- constraint satisfaction
- max sat
- search procedures
- stochastic local search
- heuristic search
- sat encodings
- lightweight
- logic programming
- multi objective