Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Logic programs with propositional connectives and aggregates   Answer set programming (ASP) is a logic programming paradigm that can be used
to solve complex combinatorial search problems. Aggregates are an ASP construct
that plays an important role in many applications. Defining a satisfactory
semantics of aggregates turned out to be a difficult problem, and in this paper
we propose a new approach, based on an analogy between aggregates and
propositional connectives. First, we extend the definition of an answer
set/stable model to cover arbitrary propositional theories; then we define
aggregates on top of them both as primitive constructs and as abbreviations for
formulas. Our definition of an aggregate combines expressiveness and
simplicity, and it inherits many theorems about programs with nested
expressions, such as theorems about strong equivalence and splitting.

21
The categories of this paper are: adap-org
22
The categories of this paper are: chao-dyn
19
The categories of this paper are: eess
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
13
The categories of this paper are: quant-ph
14
The categories of this paper are: math-ph
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
15
The categories of this paper are: nucl-ex
36
The categories of this paper are: cmp-lg
20
The categories of this paper are: acc-phys