Login / Signup
Application of Hierarchical Hybrid Encodings to Solve CSPs as Equivalent SAT Problems.
Miroslav N. Velev
Ping Gao
Published in:
ISAIM (2016)
Keyphrases
</>
sat problem
constraint satisfaction problems
boolean satisfiability
satisfiability problem
non binary
search space
constraint satisfaction
phase transition
sat instances
data structure
np complete
sat solvers
sat encodings