Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Module Theorem for The General Theory of Stable Models   The module theorem by Janhunen et al. demonstrates how to provide a modular
structure in answer set programming, where each module has a well-defined
input/output interface which can be used to establish the compositionality of
answer sets. The theorem is useful in the analysis of answer set programs, and
is a basis of incremental grounding and reactive answer set programming. We
extend the module theorem to the general theory of stable models by Ferraris et
al. The generalization applies to non-ground logic programs allowing useful
constructs in answer set programming, such as choice rules, the count
aggregate, and nested expressions. Our extension is based on relating the
module theorem to the symmetric splitting theorem by Ferraris et al. Based on
this result, we reformulate and extend the theory of incremental answer set
computation to a more general class of programs.

27
The categories of this paper are: comp-gas
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an
3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
2
The categories of this paper are: math
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph