| | |
Summary: 1
Abstract
Boolean Satisfiability solvers improved dramatically
over the last seven years [14, 13] and are commonly
used in applications such as bounded model checking,
planning, and FPGA routing. However, a number of
practical SAT instances remain difficult to solve. Recent
work pointed out that symmetries in the search space are
often to blame [1]. The framework of symmetry-break-
ing (SBPs) [5], together with further improvements [1],
was then used to achieve empirical speed-ups.
For symmetry-breaking to be successful in practice, its
overhead must be less than the complexity reduction it
brings. In this work we show how logic minimization
helps to improve this trade-off and achieve much better
empirical results. We also contribute detailed new stud-
ies of SBPs and their efficiency as well as new general
constructions of SBPs.
1 Introduction
Many search, synthesis and optimization problems aris-
|
