Compressing UNSAT Search Trees with Caching.

Anthony Blomme Daniel Le Berre Anne Parrain Olivier Roussel

Published in: ICAART (3) (2023)

Keyphrases

search tree
sat solvers
orders of magnitude
search space
constraint satisfaction
search strategies
search algorithm
branch and bound algorithm
query processing
binary search trees
branching factor
sat solving
root node
tree search
search strategy
data structure
b tree
symmetry breaking