SAT backdoors: Depth beats size.

Jan Dreier Sebastian Ordyniak Stefan Szeider

Published in: J. Comput. Syst. Sci. (2024)

Keyphrases

satisfiability problem
sat solvers
sat instances
search algorithm
depth information
sat problem
small size
sat solving
search strategies
domain independent
high quality
depth map
propositional logic
description logics
search space
propositional satisfiability
hidden structure