Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Decompositions of Grammar Constraints   A wide range of constraints can be compactly specified using automata or
formal languages. In a sequence of recent papers, we have shown that an
effective means to reason with such specifications is to decompose them into
primitive constraints. We can then, for instance, use state of the art SAT
solvers and profit from their advanced features like fast unit propagation,
clause learning, and conflict-based search heuristics. This approach holds
promise for solving combinatorial problems in scheduling, rostering, and
configuration, as well as problems in more diverse areas like bioinformatics,
software testing and natural language processing. In addition, decomposition
may be an effective method to propagate other global constraints.

37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
3
The categories of this paper are: physics
18
The categories of this paper are: econ
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
0
The categories of this paper are: hep-ph
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
2
The categories of this paper are: math