Edge Matching Puzzles as Hard SAT/CSP Benchmarks.
Carlos AnsóteguiRamón BéjarCèsar FernándezCarles MateuPublished in: CP (2008)
Keyphrases
- sat encodings
- constraint satisfaction
- constraint satisfaction problems
- sat problem
- phase transition
- sat solvers
- backtracking search
- random instances
- matching algorithm
- search algorithm
- satisfiability problem
- edge detection
- graph matching
- matching process
- weighted graph
- arc consistency
- constraint programming
- pattern matching
- unit propagation
- random sat
- planning problems
- search strategies
- max sat
- sat instances
- sat solving
- multiscale