Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Using Unsatisfiability for Solving Maximum Satisfiability   Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with
several practical applications. The most widely known MAXS AT algorithms are
ineffective at solving hard problems instances from practical application
domains. Recent work proposed using efficient Boolean Satisfiability (SAT)
solvers for solving the MaxSAT problem, based on identifying and eliminating
unsatisfiable subformulas. However, these algorithms do not scale in practice.
This paper analyzes existing MaxSAT algorithms based on unsatisfiable
subformula identification. Moreover, the paper proposes a number of key
optimizations to these MaxSAT algorithms and a new alternative algorithm. The
proposed optimizations and the new algorithm provide significant performance
improvements on MaxSAT instances from practical applications. Moreover, the
efficiency of the new generation of unsatisfiability-based MaxSAT solvers
becomes effectively indexed to the ability of modern SAT solvers to proving
unsatisfiability and identifying unsatisfiable subformulas.

36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
0
The categories of this paper are: hep-ph
17
The categories of this paper are: q-fin
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
19
The categories of this paper are: eess
29
The categories of this paper are: funct-an
9
The categories of this paper are: nlin