Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Symmetry Breaking for Maximum Satisfiability   Symmetries are intrinsic to many combinatorial problems including Boolean
Satisfiability (SAT) and Constraint Programming (CP). In SAT, the
identification of symmetry breaking predicates (SBPs) is a well-known, often
effective, technique for solving hard problems. The identification of SBPs in
SAT has been the subject of significant improvements in recent years, resulting
in more compact SBPs and more effective algorithms. The identification of SBPs
has also been applied to pseudo-Boolean (PB) constraints, showing that symmetry
breaking can also be an effective technique for PB constraints. This paper
extends further the application of SBPs, and shows that SBPs can be identified
and used in Maximum Satisfiability (MaxSAT), as well as in its most well-known
variants, including partial MaxSAT, weighted MaxSAT and weighted partial
MaxSAT. As with SAT and PB, symmetry breaking predicates for MaxSAT and
variants are shown to be effective for a representative number of problem
domains, allowing solving problem instances that current state of the art
MaxSAT solvers could not otherwise solve.

3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
26
The categories of this paper are: bayes-an
27
The categories of this paper are: comp-gas
25
The categories of this paper are: patt-sol
9
The categories of this paper are: nlin
32
The categories of this paper are: atom-ph
0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
19
The categories of this paper are: eess
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
6
The categories of this paper are: astro-ph
29
The categories of this paper are: funct-an