TY - JOUR
T1 - Well-founded ordered search
T2 - Goal-directed bottom-up evaluation of well-founded models
AU - Stuckey, Peter J.
AU - Sudarshan, S.
PY - 1997/1/1
Y1 - 1997/1/1
N2 - There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for programs with negation. However, these techniques are costly; in particular, for the special case of modularly stratified programs, Ordered Search is more efficient than the general-purpose techniques. However, Ordered Search is applicable only to modularly stratified programs. In this paper, we extend Ordered Search to compute the well-founded semantics for all (non-floundering) programs with negation. Our extension behaves exactly like Ordered Search on programs that are modularly stratified, and hence pays no extra cost for such programs.
AB - There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for programs with negation. However, these techniques are costly; in particular, for the special case of modularly stratified programs, Ordered Search is more efficient than the general-purpose techniques. However, Ordered Search is applicable only to modularly stratified programs. In this paper, we extend Ordered Search to compute the well-founded semantics for all (non-floundering) programs with negation. Our extension behaves exactly like Ordered Search on programs that are modularly stratified, and hence pays no extra cost for such programs.
UR - http://www.scopus.com/inward/record.url?scp=0031237314&partnerID=8YFLogxK
U2 - 10.1016/S0743-1066(96)00110-0
DO - 10.1016/S0743-1066(96)00110-0
M3 - Article
AN - SCOPUS:0031237314
VL - 32
SP - 171
EP - 205
JO - Journal of Logic Programming
JF - Journal of Logic Programming
SN - 0743-1066
IS - 3
ER -