Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Transformation-Based Bottom-Up Computation of the Well-Founded Model   We present a framework for expressing bottom-up algorithms to compute the
well-founded model of non-disjunctive logic programs. Our method is based on
the notion of conditional facts and elementary program transformations studied
by Brass and Dix for disjunctive programs. However, even if we restrict their
framework to nondisjunctive programs, their residual program can grow to
exponential size, whereas for function-free programs our program remainder is
always polynomial in the size of the extensional database (EDB).
  We show that particular orderings of our transformations (we call them
strategies) correspond to well-known computational methods like the alternating
fixpoint approach, the well-founded magic sets method and the magic alternating
fixpoint procedure. However, due to the confluence of our calculi, we come up
with computations of the well-founded model that are provably better than these
methods.
  In contrast to other approaches, our transformation method treats magic set
transformed programs correctly, i.e. it always computes a relevant part of the
well-founded model of the original program.

18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
21
The categories of this paper are: adap-org
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph
11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom