Abstract
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations studied by BRASS and Dix [4, 5]. The transformation approach has been introduced in more detail in [7]. In this paper we present a deeper analysis of its complexity and describe an optimized SCC-oriented evaluation. We show that by our method no more work is done than by the alternating fix-point procedure [23, 24] and that there are examples where our algorithm is significantly superior.
Cite
CITATION STYLE
Zukowski, U., Brass, S., & Freitag, B. (1997). Improving the alternating fixpoint: The transformation approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1265, pp. 40–59). Springer Verlag. https://doi.org/10.1007/3-540-63255-7_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
