Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Preferred Answer Sets for Ordered Logic Programs   We extend answer set semantics to deal with inconsistent programs (containing
classical negation), by finding a ``best'' answer set. Within the context of
inconsistent programs, it is natural to have a partial order on rules,
representing a preference for satisfying certain rules, possibly at the cost of
violating less important ones. We show that such a rule order induces a natural
order on extended answer sets, the minimal elements of which we call preferred
answer sets. We characterize the expressiveness of the resulting semantics and
show that it can simulate negation as failure, disjunction and some other
formalisms such as logic programs with ordered disjunction. The approach is
shown to be useful in several application areas, e.g. repairing database, where
minimal repairs correspond to preferred answer sets.
  To appear in Theory and Practice of Logic Programming (TPLP).

9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
34
The categories of this paper are: chem-ph
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci