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 in (Brass & Dix, 1994; Brass & Dix, 1999) 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 (Van Gelder, 1989; Van Gelder, 1993), the well-founded magic sets method (Kemp et al., 1995) and the magic alternating fixpoint procedure (Morishita, 1996). However, due to the confluence of our calculi (first noted in (Brass & Dix, 1998)), 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. These results show that our approach is a valuable tool to analyze, compare, and optimize existing evaluation methods or to create new strategies that are automatically proven to be correct if they can be described by a sequence of transformations in our framework. We have also developed a prototypical implementation. Experiments illustrate that the theoretical results carry over to the implemented prototype and may be used to optimize real life systems. 2 Stefan Brass et al.
منابع مشابه
Transformation - Based Bottom - Up Computationof the Well - Founded
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix 6, 7]. However, their \residual program" can grow to exponential size, whereas for function-free programs our \program remain-der" is always polynomial in the size, i.e. the number of tuples, of t...
متن کاملStabel Model Implementation of Layer Supported Models by Program Transformation
• For practical applications, availability of a top-down query-driven procedure is most convenient for ease of use and efficient computation of answers, when employing Logic Programs as knowledge bases • 2-valued semantics for Normal Logic Programs (NLPs) allowing top-down query-solving is highly desirable, but the Stable Models semantics (SM) does not permit it, for lack of the " relevance " p...
متن کاملTransformation - Based Bottom - Upcomputation of the Well - Foundedmodel Stefan
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix BD94, BD97, BD98a]. However, their \residual program" can grow to exponential size, whereas for function-free programs our \program remain-der" is always polynomial in the size of the extensional ...
متن کاملMagic Computation for Wll-founded Semantics
We propose a new realization of goal-directed query evaluation of (non-oundering) normal logic programs for the well-founded semantics. To this end we introduce a new magic templates transformation and give a new xed point characterization of the well-founded semantics, lifting an existing deenition from the ground to the non-ground case. The new xed point characterization enables us to show a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 1 شماره
صفحات -
تاریخ انتشار 1996